Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Scientia Sinica Informationis

Nonagreement secret key generation based on spatial symmetric scrambling and secure polar coding

Shengjun Zhang, Liang Jin, Yu Hong Huang, Shilei Zhu, Kaizhi Huang, Zhong Zhou

Published Apr 1, 2019• 0 citations
Publisher

Abstract

Most existing secret key generation (SKG) methods are complicated and depend on the security capacity. This study aims to propose a non-agreement SKG method based on spatial symmetric scrambling (SSS) and secure polar coding (SPC), which only consists of secure transmission and privacy amplification. First, SSS provides a channel advantage and high security by replacing traditional Gaussian artificial noise with signal-like noise to ensure the existence of secure capacity. Second, the SPC is designed through Gaussian approximation and generic algorithm based on the acquired channel advantage and desired SKG performance to guarantee the security of transmitted information. Finally, the secret information is safely transmitted through SPC and SSS, and secret keys can be further generated by privacy amplification. The simulated results verify the feasibility of SSS and SPC and further illustrate that the proposed SKG method can meet the designed performance requirement. The National Institute of Standards and Technology test is also conducted and the results show the strong randomness of the generated keys.

DOI
10.1360/n112018-00119

Related papers

On Quantization for Secret Key Generation From Wireless Channel Samples

Muhammad Adil, Shurjeel Wyne, Syed Junaid Nawaz

Physical layer security (PLS) techniques hold promise for augmenting secure communications in the 5thgeneration of mobile wireless networks. Secret key generation (SKG) is a PLS technique which exploits the wireless propagation channel's randomness to generate symmetric key bits for information encryption and decryption. This work proposes symmetric key generation based on non-uniform quantization of the received signal strength (RSS) samples of a Nakagami-$m$ fading channel. The proposed strategy for non-uniform quantization for SKG aims to set quantization thresholds for maximal key randomness and high values of key generation rate (KGR) and key agreement probability (KAP). Finally, a framework is proposed to use single node RSS measurements, readily available in the literature, to generate RSS samples at the other link end. This framework facilitates the testing of new SKG algorithms that require simultaneous RSS measurements by the legitimate nodes, which are not readily available in the open literature. The effectiveness of the proposed SKG scheme is validated through Monte Carlo methods and the National Institute of Standards and Technology (NIST) test suite for assessing the randomness of the generated key sequence.

IEEE Access•Jan 1, 2021•44 citations

Multi-User Secret Key Generation for WSNs via Wireless Channels

Mehmet Ali Aygül, Ebubekir Memişoğlu, Hakan Ali Cirpan +1 more

Wireless sensor networks (WSNs) are resource-constrained and highly vulnerable to eavesdropping due to their broadcast nature. Traditional symmetric key cryptography provides strong security but imposes excessive computational and energy demands on sensor nodes. Physical layer–based secret key generation (SKG) offers a lightweight alternative by exploiting channel reciprocity and randomness; however, existing methods are mostly limited to two-user scenarios and lack scalability in multi-user settings. This paper introduces two scalable multi-user SKG frameworks: a sequential method and a star topology-based method. In the sequential method, users cooperatively relay random signals to derive a shared key, while the star topology leverages a central node for signal aggregation and redistribution. A comparative analysis reveals trade-offs between the proposed methods. The sequential method is more computationally efficient but sensitive to node failures, while the star topology offers lower delay at the cost of requiring a fully connected central node. Analyses and simulations confirm both methods’ effectiveness in key mismatch probability, key generation rate, and key randomness validated by the National Institute of Standards and Technology test suite.

IEEE Open Journal of the Communications Society•Jan 1, 2025•0 citations

Huffman Coding-Inspired Secret Key Generation from Wireless Channel for Secure Communications

Elmi Hassan Farah, Syed Junaid Nawaz, Shurjeel Wyne +3 more

As Beyond 5thGeneration (B5G) networks expand, securing communication links remains a challenge. Physical Layer Security (PLS) is a promising paradigm, and this work explores wireless channel-based Secret Key Generation (SKG) by proposing an Extended Huffman Coding (EHC) framework to enhance quantization stage. While non-uniform coding is common in Analog-to-Digital (A2D) conversion, it remains largely unexplored in SKG due to key mismatch risks. To address this, we propose a Huffman Coding (HC)-inspired framework that generates binary codes using reversed HC principles and extends them by sequentially altering the Least Significant Bit (LSB), ensuring equal-length unique codes for quantization levels while enhancing generation rate, agreement, and randomness. Additionally, histogram/ Probability Density Function (PDF) matching aligns quantization level probabilities at legitimate nodes to minimize mismatches while exchanging minimal statistical information without compromising secrecy. Unlike conventional quantization, which relies on predetermined codes vulnerable to eavesdropping, our scheme dynamically computes quantization codes at runtime, adding an extra layer of security. Moreover, while conventional HC avoids codes of a level to be a subcode of another level, SKG benefits when one code is a subcode of another, making detection harder. Instead of compression, as desired in conventional A2D conversion, SKG requires longer and random keys that reliably match at legitimate nodes, which our scheme ensures. Simulations are conducted under Rice-fading conditions that evaluate the impact of variations in the Rician K-factor on SKG performance. The proposed method is assessed using key SKG metrics named: Key Agreement Rate (KAR), Key Generation Rate (KGR), and Key Randomness Rate (KRR) (employing the NIST test suite). The obtained results demonstrate the potential of our proposed scheme for secure and scalable SKG solutions in future networks.

IEEE Vehicular Technology Conference•Oct 19, 2025•1 citation

Polar Coding for Secure Transmission and Key Agreement

O. Ozan Koyluoglu, Hesham El Gamal

Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arıkan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.

arXiv:1003.1422•Mar 6, 2010•12 citations

Polar coding for secure transmission and key agreement

O. Ozan Koyluoglu, Hesham El Gamal

Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arikan. It is shown that polar codes achieve nontrivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2010•53 citations

Secret Key Generation with Signal-like Noise in Polar Coded Wireless MIMO Systems

Meixiang Zhang, Xueqin Jiang, Yu‐Ting Huang

Physical-layer secret key generation is a meaningful approach to enhance the security of wireless links by taking advantages of wireless channels. However eavesdroppers may obtain the secret key bits if their channels become correlated to the legitimate channels. In this paper, to increase the mismatch rate at the eavesdroppers, we propose a new secret key generation scheme for polar coded multiple-input multiple-output (MIMO) systems by applying MIMO precoding and adding signal-like noise on the transmitted signals. Furthermore, considering the channel polarization phenomenon of polar codes, we propose to adaptively send messages that are used for secret key generation over the less reliable channel-bits of eavesdroppers. In addition, we propose to add randomness to messages to ensure that eavesdroppers are unable to generate the secret key bits even when their channels are highly correlated to the legitimate channels. Simulation results demonstrate that our proposed scheme prevents eavesdroppers to generate the secret key with an extremely high probability.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 1, 2019•0 citations
Most existing secret key generation (SKG) methods are complicated and depend on the security capacity. This study aims to propose a non-agreement SKG method based on spatial symmetric scrambling (SSS) and secure polar coding (SPC), which only consists of secure transmission and privacy amplification. First, SSS provides a channel advantage and high security by replacing traditional Gaussian artificial noise with signal-like noise to ensure the existence of secure capacity. Second, the SPC is designed through Gaussian approximation and generic algorithm based on the acquired channel advantage and desired SKG performance to guarantee the security of transmitted information. Finally, the secret information is safely transmitted through SPC and SSS, and secret keys can be further generated by privacy amplification. The simulated results verify the feasibility of SSS and SPC and further illustrate that the proposed SKG method can meet the designed performance requirement. The National Institute of Standards and Technology test is also conducted and the results show the strong randomness of the generated keys.
Physical layer security (PLS) techniques hold promise for augmenting secure communications in the 5thgeneration of mobile wireless networks. Secret key generation (SKG) is a PLS technique which exploits the wireless propagation channel's randomness to generate symmetric key bits for information encryption and decryption. This work proposes symmetric key generation based on non-uniform quantization of the received signal strength (RSS) samples of a Nakagami-mmm fading channel. The proposed strategy for non-uniform quantization for SKG aims to set quantization thresholds for maximal key randomness and high values of key generation rate (KGR) and key agreement probability (KAP). Finally, a framework is proposed to use single node RSS measurements, readily available in the literature, to generate RSS samples at the other link end. This framework facilitates the testing of new SKG algorithms that require simultaneous RSS measurements by the legitimate nodes, which are not readily available in the open literature. The effectiveness of the proposed SKG scheme is validated through Monte Carlo methods and the National Institute of Standards and Technology (NIST) test suite for assessing the randomness of the generated key sequence.
Wireless sensor networks (WSNs) are resource-constrained and highly vulnerable to eavesdropping due to their broadcast nature. Traditional symmetric key cryptography provides strong security but imposes excessive computational and energy demands on sensor nodes. Physical layer–based secret key generation (SKG) offers a lightweight alternative by exploiting channel reciprocity and randomness; however, existing methods are mostly limited to two-user scenarios and lack scalability in multi-user settings. This paper introduces two scalable multi-user SKG frameworks: a sequential method and a star topology-based method. In the sequential method, users cooperatively relay random signals to derive a shared key, while the star topology leverages a central node for signal aggregation and redistribution. A comparative analysis reveals trade-offs between the proposed methods. The sequential method is more computationally efficient but sensitive to node failures, while the star topology offers lower delay at the cost of requiring a fully connected central node. Analyses and simulations confirm both methods’ effectiveness in key mismatch probability, key generation rate, and key randomness validated by the National Institute of Standards and Technology test suite.
As Beyond 5thGeneration (B5G) networks expand, securing communication links remains a challenge. Physical Layer Security (PLS) is a promising paradigm, and this work explores wireless channel-based Secret Key Generation (SKG) by proposing an Extended Huffman Coding (EHC) framework to enhance quantization stage. While non-uniform coding is common in Analog-to-Digital (A2D) conversion, it remains largely unexplored in SKG due to key mismatch risks. To address this, we propose a Huffman Coding (HC)-inspired framework that generates binary codes using reversed HC principles and extends them by sequentially altering the Least Significant Bit (LSB), ensuring equal-length unique codes for quantization levels while enhancing generation rate, agreement, and randomness. Additionally, histogram/ Probability Density Function (PDF) matching aligns quantization level probabilities at legitimate nodes to minimize mismatches while exchanging minimal statistical information without compromising secrecy. Unlike conventional quantization, which relies on predetermined codes vulnerable to eavesdropping, our scheme dynamically computes quantization codes at runtime, adding an extra layer of security. Moreover, while conventional HC avoids codes of a level to be a subcode of another level, SKG benefits when one code is a subcode of another, making detection harder. Instead of compression, as desired in conventional A2D conversion, SKG requires longer and random keys that reliably match at legitimate nodes, which our scheme ensures. Simulations are conducted under Rice-fading conditions that evaluate the impact of variations in the Rician K-factor on SKG performance. The proposed method is assessed using key SKG metrics named: Key Agreement Rate (KAR), Key Generation Rate (KGR), and Key Randomness Rate (KRR) (employing the NIST test suite). The obtained results demonstrate the potential of our proposed scheme for secure and scalable SKG solutions in future networks.
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arıkan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.
Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Arikan. It is shown that polar codes achieve nontrivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.
Physical-layer secret key generation is a meaningful approach to enhance the security of wireless links by taking advantages of wireless channels. However eavesdroppers may obtain the secret key bits if their channels become correlated to the legitimate channels. In this paper, to increase the mismatch rate at the eavesdroppers, we propose a new secret key generation scheme for polar coded multiple-input multiple-output (MIMO) systems by applying MIMO precoding and adding signal-like noise on the transmitted signals. Furthermore, considering the channel polarization phenomenon of polar codes, we propose to adaptively send messages that are used for secret key generation over the less reliable channel-bits of eavesdroppers. In addition, we propose to add randomness to messages to ensure that eavesdroppers are unable to generate the secret key bits even when their channels are highly correlated to the legitimate channels. Simulation results demonstrate that our proposed scheme prevents eavesdroppers to generate the secret key with an extremely high probability.