Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Difference-based shared key extraction scheme via multi-level quantization
Qiong LI, Chunyi CHEN, Zhenzhong ZHANG, Bo YU, Haiyang YU, Xiaojuan HU
Journal of Computer Applications    2026, 46 (3): 839-846.   DOI: 10.11772/j.issn.1001-9081.2025030297
Abstract60)   HTML0)    PDF (823KB)(12)       Save

Legitimate communicating parties can leverage the randomness of wireless channel state to extract shared key sequences that are information-theoretically secure. To enhance the efficiency of wireless channel key extraction, a difference-based shared key extraction scheme via multi-level quantization was proposed. In the scheme, random modulation was employed to perform high-frequency sampling of the wireless channel, and two quantization algorithms integrated with random sampling difference — Adaptive Symbol Quantization (ASQ) and Balanced Multi-bit Modified Quantization (BMMQ) — were introduced to process the first-order differential sequence, so as to obtain the original key sequence. On this basis, an information negotiation algorithm was applied to correct inconsistent bits in the original key, and the signal was reconstructed using the original key and the first-order differential sequence, and then the signal was requantized, ultimately achieving key synchronization between legitimate communicating parties. Experimental results demonstrate that random sampling difference reduces the correlation coefficient between adjacent sample points to below e?1, thereby decreasing statistical dependence in the key sequence effectively; under a Signal-to-Noise Ratio (SNR) of 25 dB, the ASQ algorithm reduces the Key Disagreement Rate (KDR) to 3.8×10?? while maintaining an Original Key Extraction Rate (OKER) of 0.86; under lossless quantization conditions, the BMMQ algorithm reduces the KDR to 7×10?3. The finally generated shared key sequences pass the NIST (National Institute of Standards and Technology) randomness test, validating the security and effectiveness of the keys.

Table and Figures | Reference | Related Articles | Metrics
Method for unsupervised text location based on brightness grading and direction density
Qiong LIU Hui-can ZHOU Yao-nan WANG
Journal of Computer Applications   
Abstract1867)      PDF (693KB)(1053)       Save
A method for unsupervised text location based on brightness grading and direction density was proposed, which was according to the fact that text in scenes generally has strong contrast with local background. Brightness grading was made in R, G, B color layers separately to decrease the complexity of the background. After that, by using the characteristic of obvious directionality of text strokes, a rough text location was carried out according to direction density. And then, precise discrimination was implemented with a SVM multi-class classifier. The mentioned method overcame the difficulty to choose color clustering number in common unsupervised ways, and constrained the types of candidate areas. Hence the difficulty of training SVM classifier was reduced. Those made the new method had higher accuracy and robustness.
Related Articles | Metrics