International Conference on Electronic Information Engineering and Computer Science (EIECS)

Interleaved Group Quantization Algorithm for Key Extraction in Random Modulation Channel Sharing

Fang Wanglst, Chunyi Chen, Haiyang Yu, Zhuozhan Tian

Published Sep 27, 2024• 0 citations

Abstract

Extracting characteristic information from atmospheric optical channels can be utilized to generate shared keys for communication parties. However, the autocorrelation of channel feature information within the correlation time caused by atmospheric turbulence limits the number of unrelated key bits that can be extracted per second. To address this issue, a shared key extraction scheme for random modulation channels is proposed. The scheme employs a controllable shared random source model with memory (CCRSM) to quantify the observed values of CCRSM to obtain keys. During the quantization phase, an interleave block quantization algorithm is employed. Initially, legitimate parties interleave and group the obtained CCRSM observations to eliminate the impact of temporal autocorrelation; subsequently, the processed CCRSM observations are quantified using a single-threshold method per group to obtain an initial bit sequence; finally, an encoding mapping operation is applied to generate the key sequence. This algorithm ensures that the keys extracted between legitimate communication parties have a low inconsistency rate and good randomness, and the key generation rate is significantly improved. Experimental results indicate that this scheme effectively reduces the key disagreement rate and enhances the key generation rate. Under a signal-to-noise ratio (SNR) of 30dB, the scheme achieves a key disagreement rate of 4.39×10−4and a key generation rate of 2.99×106bits per second, and the generated shared random keys pass the randomness tests of the National Institute of Standards and Technology (NIST).

DOI: 10.1109/eiecs63941.2024.10800544

Related papers

Enhanced secret-key generation from atmospheric optical channels with the use of random modulation

Chun‐Yi Chen, Qiong Li

Secret-key extraction from atmospheric optical channels can generate common keys used by two communicating parties to encrypt their transmitted confidential information. The correlation time of turbulence-induced optical fluctuations imposes a restriction on the number of extracted uncorrelated key bits per second. To break this restriction, we propose a novel randomness sharing scheme between two communicating parties using an atmospheric optical channel equipped with random modulation and develop mathematical models for the common randomness source created by such a randomness-sharing scheme. Our randomness-sharing scheme provides the legitimate parties with the ability to decrease the temporal autocorrelation of the said common randomness source, which is called controllable common randomness source with memory (CCRSM), thereby enabling an enhanced secret-key extraction that can break the aforementioned restriction. Both the autocorrelation of the legitimate parties' observations of the CCRSM and the cross-correlation of the two legitimate parties' observations of the CCRSM are formulated and examined theoretically. It is found that the performing random modulation can decorrelate consecutive observations of the CCRSM obtained by the legitimate parties using a sampling interval smaller than the correlation time of turbulence-induced optical fluctuations. The cross-correlation coefficient of the eavesdropper's and legitimate parties' observations of the CCRSM is dealt with theoretically and the eavesdropping risk in the CCRSM-based key extraction is inspected for the fully-disclosed-single-modulation worst eavesdropping (FDSM-WE) scenario, partially-disclosed-single-modulation worst eavesdropping (PDSM-WE) scenario and double-modulation worst eavesdropping (DM-WE) scenario. It is shown that the FDSM-WE scenario has the highest degree of eavesdropping risk. Finally, the lowest limit of the secret-key capacity in consideration of using the CCRSM is theoretically formulated. The effects of random modulation on such the lowest limit are quantitatively analyzed from an information-theoretic perspective. It is manifested that random modulation does not harm the potential of extracting secret keys from the CCRSM's randomness component stemming from turbulence-induced optical fluctuations.

Optics ExpressOct 25, 202213 citations

Secret-key distribution over atmospheric wireless optical channels assisted by turbulence-induced fading scrambling

Qiong Li, Chunyi Chen, Bo Yu +1 more

Secret-key distribution leveraging the fading characteristics of wireless optical channels has attracted significant attention. To address the challenges of high-frequency sampling over slowly varying channels, a turbulence-induced fading scrambling-assisted key distribution scheme is proposed to enhance the randomness of shared keys. Combined with random modulation, the scheme enables legitimate parties to obtain more decorrelated wireless signal sequences. Additionally, a specialized interleave quantization (IQ) method is introduced to improve the statistical properties of the generated keys. The entire observation sequence is processed using IQ to mitigate the impact of large-scale slow channel variations. Simulation and experimental results demonstrate that the proposed scheme generates highly random original key sequences at high sampling frequencies without increasing the key disagreement rate (KDR). The final key sequence, incorporating random modulation and interleaving, is evaluated using the NIST test suite, yielding p-values greater than 0.01. These results confirm the effectiveness of the proposed scheme in generating statistically random shared secret keys under slowly varying wireless optical channels.

International Conference on Intelligent Computing and System Simulation (ICSS)Dec 22, 20250 citations

B+-Tree-Quantization-Based Shared Secret Key Extraction Scheme From Atmospheric Optical Wireless Channel

Gang Pan, Chunyi Chen

To reduce key disagreement rate and increase key generation rate, this paper proposes a lightweight and robust shared secret key extraction scheme from atmospheric optical wireless channel. A conception of grouping samples by using B+ tree and quantizing groups is introduced to improve the balance of distribution of channel measurement values in quantization intervals. Based on the conception, a basic B+ tree quantization algorithm (B-BPTQ) and a compensation-technology-based B+ tree quantization algorithm (C-BPTQ) are designed. A LDPC-based multi-scale information reconciliation algorithm (LDPC-MSIR) is put forward to simplify information reconciliation and reduce its computation complexity. An enhanced randomness post-processing algorithm is formulated to increase statistical randomness of initial key sequence. Finally, the performance of the proposed scheme is validated by numerical simulations and field experiments. The experimental results show that it has better performance in terms of key disagreement rate, key generation rate and key randomness compared with other schemes.

IEEE Transactions on CommunicationsOct 23, 20242 citations

Instant and Secure Channel Key Extraction Scheme Among Wireless Devices

Hong Qiang Zhao, Enting Guo, Chunhua Su +1 more

Device-to-device communication is increasingly important for emerging wireless applications, including the Internet of Things and industry mobile networks. To establish a secure communication channel between multiple legitimate devices, key agreement is an essential first step. Physical layer channel information is a promising technology for achieving communication security by generating a shared channel key. In this paper, we propose an efficient and random method for generating channel keys based on channel state information (CSI). Firstly, we preprocess the available subcarriers to reduce the correlation of adjacent subcarriers. Secondly, we propose a novel quantization process to generate random and secure channel keys. The part consists of two phases: the quantization phase and the inconsistency removal phase. In the quantization stage, CSI sub carriers are grouped into small blocks, and appropriate thresholds are generated. Then, wireless users quantize the CSI subcarriers into initial bit streams of 0 and 1 with different thresholds. In the inconsistency removal phase, we design an error correction mechanism where wireless users exchange the discarded index sequences in the initial bit streams to achieve key sequence consistency. We implement the proposed scheme using off-the-shelf wireless devices and evaluate its performance. The experimental results show that each CSI packet can produce 30 bits, which have passed the NIST randomness tests.

GlobecomDec 4, 20234 citations

A Lightweight and Efficient Physical Layer Key Generation Mechanism for MANETs

Xiaomiao Gao, Wenjie Du, Weijiang Liu +2 more

Due to the reciprocity of wireless channels, the communication parties can directly extract the shared key from channel. This solution were verified through several schemes. However, in real situations, channel sampling of legitimate transceivers might be impacted by noises and other interferences, which makes the channel states obtained by initiator and responder might be obvious different. The efficiency and even availability of physical layer key generation are thus reduced. In this paper, we propose a lightweight and efficient physical layer key generation scheme, which extract shared secret keys from channel state information (CSI). To improve the key generation process, the discrete cosine transform (DCT) is employed to reduce differences of channel states of legitimate transceivers. Then, these outputs are quantified and encoded through multi-bit adaptive quantization(MAQ) quantizer and gray code to generate binary bit sequence, which can greatly reduce the bit error rate. Moreover, the low density parity check (LDPC) code and universal hashing functions are used to achieve information reconciliation and privacy amplifification. By adding preprocessing methods in the key generation process and using the rich information of CSI, the security of communications can be increased on the basis of improving the key generation rate. To evaluate this scheme, a number of experiments in various real environments are conducted. The experimental results show that the proposed scheme can effificiently generate shared secret keys for nodes and protect their communication.

IEEE International Conference on Computer and Communications (ICCC)Dec 11, 20205 citations

A Novel Physical Layer Key Generation and Authenticated Encryption Protocol Exploiting Shared Randomness

Cornelius Onuvoye Saiki

The use of wireless networks for communication has grown significantly in recent times, and continues to develop further. The broadcast nature of wireless communications makes them susceptible to a wide variety of security attacks. Unlike traditional solutions, which usually handle security at the application layer, the primary concern of this dissertation is to analyse and develop solutions for secure communication using channel coding techniques at the physical-layer. \nThe topic of physical layer authenticated encryption using high rate key generation through shared randomness is investigated in this work. First, a physical layer secret key generation scheme is discussed exploiting channel reciprocity in wireless systems. In order to address the susceptibility of this family of schemes to active attacks, a novel physical layer authentication encryption protocol is presented along with its extension to multi-node networks in the presence of active adversaries. Unlike previous work in the area of generating secret keys through shared randomness, it is demonstrated that the proposed scheme is semantically secure with respect to chosen plaintext and chosen cipher text attacks. \nSecondly, in order to increase the rate in bits per seconds at which agreed cryptographic keys are been generated, a multi-level quantization algorithm with public feedback is discussed. It is demonstrated that the proposed scheme is superior to direct information distillation approaches and can substantially increase the key generation rates even at low and medium SNRs. Furthermore, the employment of this low-overhead feedback at the information distillation process can largely simplify the information reconciliation process. \nThe proposed secret key generation schemes are tested for randomness such as required for cryptographic keys. The validation test is perfomed with the aid of National Institute of Standards and Technology (NIST) statistical test suite. The P-values obtained in each of the test carried out indicates that the key sequence generated by our algorithm is random.

May 5, 20160 citations