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

International Conference on Communication, Image and Signal Processing (CCISP)

Rate Adaptive Reconciliation Based on Reed-Solomon Codes

Junyuan Cheng, Xueqin Jiang, Enjian Bai, Yun Ping Wu, Han Hai, Feng Pan, Yuyang Peng

Published Nov 1, 2021• 3 citations
Publisher

Abstract

Security of physical layer key generation is based on the randomness and reciprocity of wireless fading channel, which has attracted more and more attention in recent years. This paper proposes a rate adaptive key agreement scheme and utilizes the received signal strength (RSS) of the channel between two wireless devices to generate the key. In conventional information reconciliation process, the bit inconsistency rate is usually eliminated by using the filter method, which increases the possibility of exposing the generated key bit string. Building on the strengths of existing secret key extraction approaches, this paper develops a scheme that uses Reed-Solomon (RS) codes, one of forward error correction channel codes, for information reconciliation. Owing to strong error correction performance of RS codes, the proposed scheme can solve the problem of inconsistent key bit string in the process of channel sensing. At the same time, the composition of RS codes can help the scheme realize rate adaptation well due to the construction principle of error correction code, which can freely control the code rate and achieve the reconciliation method of different key bit string length. Through experiments, we find that when the number of inconsistent key bits is not greater than the maximum error correction number of RS codes, it can well meet the purpose of reconciliation.

DOI
10.1109/ccisp52774.2021.9639332

Related papers

Non-Reconciled Physical-Layer Keys-Assisted Secure Communication Scheme Based on Channel Correlation

Meng Wang, Kaizhi Huang, Zheng Wan +3 more

Physical-layer key generation technology requires information reconciliation to correct channel estimation errors between two legitimate users. However, sending the reconciliation signals over the public channel increases the communication overhead and the risk of information leakage. Aiming at the problem, integrated secure communication schemes using non-reconciled keys have attracted extensive attention. These schemes exploit channel coding to correct both inconsistent keys and transmission error bits. Meanwhile, more redundant code bits must be added to correct errors, which results in a lower secure transmission rate. To address the problem, we analyze the merit of channel correlation between non-reconciled key generation and secure transmission. Inspired by this, we propose a non-reconciled physical-layer keys-assisted secure communication scheme based on channel correlation. First of all, the signal frame is designed to make use of channel correlation between non-reconciled key generation and secure transmission. Based on the channel correlation, non-reconciled keys are then generated from the wireless channel to encrypt transmitted data. Moreover, an adaptive coding algorithm based on the equivalent channel is presented to encode the data bits before encryption, to guarantee reliable transmission. Finally, theoretical analysis and simulations demonstrate the significant performance of the proposed scheme in terms of low bit error ratio and high secure transmission rate.

Entropy•Aug 22, 2022•1 citation

A Novel Hybrid Protocol and Code Related Information Reconciliation Scheme for Physical Layer Secret Key Generation

Et al. Sujata Kadam

Wireless networks are vulnerable to various attacks due to their open nature, making them susceptible to eavesdropping and other security threats. Eavesdropping attack takes place at the physical layer. Traditional wireless network security relies on cryptographic techniques to secure data transmissions. However, these techniques may not be suitable for all scenarios, especially in resource-constrained environments such as wireless sensor networks and adhoc networks. In these networks having limited power resources, generating cryptographic keys between mobile entities can be challenging. Also, the cryptographic keys are computationally complex and require key management infrastructure. Physical Layer Key Generation (PLKG) is an emerging solution to address these challenges. It establishes secure communication between two users by taking advantage of the wireless channel's inherent features. PLKG process involves channel probing, quantization, information reconciliation (IR) and privacy amplification to generate symmetric secret key. The researchers have used various PLKG techniques to get the secret key, sTop of Form till they face problems in the IR scheme to obtain symmetric keys between the users who share the same channel for communication. Both the code based and protocol based methods proposed in the literature have advantages and limitations related to their performance parameters such as information leakage, interaction delay and computation complexity. This research work proposes a novel IR mechanism that combines the protocol and code-based error correction methods to obtain reduced Bit Mismatch Rate (BMR), reduced information leakage, reduced interaction delay, and reduced computational time to enhance physical layer secret key's quality. In the proposed research work, the channel samples are generated using the Received Signal Strength (RSS) and Channel Impulse Response (CIR) parameters. These samples are quantized using Vector Quantization with Affinity Propagation Clustering (VQAPC) method to generate the preliminary key. The samples collected by the two users who wish to communicate, (for example Alice and Bob) will be different due to noise in the channel and hardware limitations. Hence their preliminary keys will be different. Removing this discrepancy between Bob's and Alice's initial keys, using novel Hybrid Protocol and Code related Information Reconciliation (HPC-IR) scheme to generate error corrected key, is the most important contribution of this research work. This key is further encoded by the MD5 hash function to generate a final secret key for exchanging information between two users over the wireless channel. It is observed that the proposed HPC-IR scheme achieves BMR of 19.4%, information leakage is 0.002, interaction delay is 0.001 seconds and computation time is 0.02 seconds.

International Journal on Recent and Innovation Trends in Computing and Communication•Nov 5, 2023•0 citations

An Efficient Information Reconciliation Scheme via Partial Encoding for Physical Layer Secret Key Generation

Toshiki Matsumine, Hideki Ochiai, Junji Shikata

This letter proposes an efficient information reconciliation coding scheme for physical layer secret key generation. We consider a high-rate key generation system, where multiple key bits are extracted from one Gaussian random variable source, each of which has different reliability depending on its bit level. Although the conventional bit-interleaved coded modulation (BICM)-type reconciliation protects all the key bits by forward error correction (FEC), the computational complexity associated with its encoding and decoding can be a bottleneck in achieving a high secret key rate especially for low-cost devices with limited computational capabilities. To alleviate this complexity issue, we propose a new reconciliation scheme that efficiently reduces the complexity by applying FEC only to the least reliable bits (LRBs). We demonstrate by simulations that the proposed information reconciliation based on partial encoding achieves a lower key bit mismatch rate (BMR) than the conventional BICM-type reconciliation even with lower decoding complexity. Furthermore, we provide a lower bound on the asymptotic BMR of the proposed scheme that is useful for estimating the performance in high signal-to-noise ratio (SNR) regimes.

IEEE Communications Letters•Apr 1, 2024•6 citations

A Secrete Key Extraction Using Received Signal Strength (RSS) of Wireless Networks

T, Solai Rajan, J, Udaya Kumar D, Mahato, Anima

In this paper, we evaluate the effectiveness of secret key extraction from the Received signal strength (RSS) variations on the wireless channel between the two devices for private communication between them. We use real world measurements of RSS in a variety of environments and settings. The results from our experiments with 802.11-based laptops show that 1)An adversary can cause predictable key generation in these static environments, and 2)In dynamic scenarios where the two devices are mobile, high entropy bits are obtained . Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive Cascade-based information reconciliation and privacy amplification. In our scheme, to provide good scalability in terms of the number of nodes, we utilize a combinatorial design of public-private key pairs, which means nodes combine more than one key pair to encrypt and decrypt messages. We also show that it provides controllable resilience when malicious nodes compromise a limited number of nodes before key revocation and renewal.

•Apr 25, 2015•0 citations

Secret Key Generation Using Polar Code-Based Reconciliation Method in 5G

Jingnuo Peng, Kaizhi Huang, Shuaifang Xiao +1 more

Physical layer key generation is one of the promising candidate technology schemes for communication network encryption as it promises to solve the difficulties in traditional cryptographic mechanisms. However, due to the existence of unequal key bits in the process of key generation, the practical application of physical layer key generation is greatly hindered. In this paper, in order to eliminate the key inconsistency problem, we propose a Polar code-based information reconciliation scheme (PIRS) by combining the design mechanism of the 5th generation (5G) physical control channel processing flow in the 5G physical layer protocol. The Monte Carlo simulation results show that our proposed method can significantly reduce the key disagreement rate (KDR) and increase the key generation rate (KGR) for both parties in communication, even when the signal-to-noise ratio is low.

International Conference on Advanced Computing and Endogenous Security•Apr 21, 2022•5 citations

Performance Enhancement of RSS-Based Secret Key Generation using Lightweight Minimal Bit Syndrome Reconciliation Method for IoT Devices

Choirun Nisa, M. Cahyo Kriswantoro

Secure communication in Internet of Things (IoT) devices can be improved through physical-layer secret key generation. In secret key generation, an information reconciliation process is required to match the bit sequences between the two communicating devices. However, this process often involves complex statistical computations that increase system overhead and require the transmission of bits over an insecure public channel. Therefore, this research presents a lightweight reconciliation algorithm based on minimal bit syndrome to reduce overhead and improve key security. The proposed method processes quantized Received Signal Strength (RSS) values into 8-bit block syndrome-based reconciliation mechanism and only the 8-bit syndromes from mismatched block are transmitted over the public channel. System testing was conducted under both static and dynamic scenarios in an indoor area using Raspberry Pi nodes. The results show that the proposed scheme demonstrates an improvement in the Key Generation Rate (KGR) by 2.2% and reduces the processing time by 11.6% in dynamic scenario and 8.3% in the static scenario. Also, the proposed scheme reduce the quantization and reconciliation time by 50% compared to previous research. Furthermore, the proposed method maintained a Key Disagreement Rate (KDR) of 0% across all block size and successfully passed the NIST randomness and complexity test, with all test parameters achieving p-values above 0.01. These result indicate that the proposed scheme improve the performance of existing secret key generation methods and it is suitable for implementation in IoT devices.

Telekontran Jurnal Ilmiah Telekomunikasi Kendali dan Elektronika Terapan•Oct 1, 2025•0 citations
Security of physical layer key generation is based on the randomness and reciprocity of wireless fading channel, which has attracted more and more attention in recent years. This paper proposes a rate adaptive key agreement scheme and utilizes the received signal strength (RSS) of the channel between two wireless devices to generate the key. In conventional information reconciliation process, the bit inconsistency rate is usually eliminated by using the filter method, which increases the possibility of exposing the generated key bit string. Building on the strengths of existing secret key extraction approaches, this paper develops a scheme that uses Reed-Solomon (RS) codes, one of forward error correction channel codes, for information reconciliation. Owing to strong error correction performance of RS codes, the proposed scheme can solve the problem of inconsistent key bit string in the process of channel sensing. At the same time, the composition of RS codes can help the scheme realize rate adaptation well due to the construction principle of error correction code, which can freely control the code rate and achieve the reconciliation method of different key bit string length. Through experiments, we find that when the number of inconsistent key bits is not greater than the maximum error correction number of RS codes, it can well meet the purpose of reconciliation.
Physical-layer key generation technology requires information reconciliation to correct channel estimation errors between two legitimate users. However, sending the reconciliation signals over the public channel increases the communication overhead and the risk of information leakage. Aiming at the problem, integrated secure communication schemes using non-reconciled keys have attracted extensive attention. These schemes exploit channel coding to correct both inconsistent keys and transmission error bits. Meanwhile, more redundant code bits must be added to correct errors, which results in a lower secure transmission rate. To address the problem, we analyze the merit of channel correlation between non-reconciled key generation and secure transmission. Inspired by this, we propose a non-reconciled physical-layer keys-assisted secure communication scheme based on channel correlation. First of all, the signal frame is designed to make use of channel correlation between non-reconciled key generation and secure transmission. Based on the channel correlation, non-reconciled keys are then generated from the wireless channel to encrypt transmitted data. Moreover, an adaptive coding algorithm based on the equivalent channel is presented to encode the data bits before encryption, to guarantee reliable transmission. Finally, theoretical analysis and simulations demonstrate the significant performance of the proposed scheme in terms of low bit error ratio and high secure transmission rate.
Wireless networks are vulnerable to various attacks due to their open nature, making them susceptible to eavesdropping and other security threats. Eavesdropping attack takes place at the physical layer. Traditional wireless network security relies on cryptographic techniques to secure data transmissions. However, these techniques may not be suitable for all scenarios, especially in resource-constrained environments such as wireless sensor networks and adhoc networks. In these networks having limited power resources, generating cryptographic keys between mobile entities can be challenging. Also, the cryptographic keys are computationally complex and require key management infrastructure. Physical Layer Key Generation (PLKG) is an emerging solution to address these challenges. It establishes secure communication between two users by taking advantage of the wireless channel's inherent features. PLKG process involves channel probing, quantization, information reconciliation (IR) and privacy amplification to generate symmetric secret key. The researchers have used various PLKG techniques to get the secret key, sTop of Form till they face problems in the IR scheme to obtain symmetric keys between the users who share the same channel for communication. Both the code based and protocol based methods proposed in the literature have advantages and limitations related to their performance parameters such as information leakage, interaction delay and computation complexity. This research work proposes a novel IR mechanism that combines the protocol and code-based error correction methods to obtain reduced Bit Mismatch Rate (BMR), reduced information leakage, reduced interaction delay, and reduced computational time to enhance physical layer secret key's quality. In the proposed research work, the channel samples are generated using the Received Signal Strength (RSS) and Channel Impulse Response (CIR) parameters. These samples are quantized using Vector Quantization with Affinity Propagation Clustering (VQAPC) method to generate the preliminary key. The samples collected by the two users who wish to communicate, (for example Alice and Bob) will be different due to noise in the channel and hardware limitations. Hence their preliminary keys will be different. Removing this discrepancy between Bob's and Alice's initial keys, using novel Hybrid Protocol and Code related Information Reconciliation (HPC-IR) scheme to generate error corrected key, is the most important contribution of this research work. This key is further encoded by the MD5 hash function to generate a final secret key for exchanging information between two users over the wireless channel. It is observed that the proposed HPC-IR scheme achieves BMR of 19.4%, information leakage is 0.002, interaction delay is 0.001 seconds and computation time is 0.02 seconds.
This letter proposes an efficient information reconciliation coding scheme for physical layer secret key generation. We consider a high-rate key generation system, where multiple key bits are extracted from one Gaussian random variable source, each of which has different reliability depending on its bit level. Although the conventional bit-interleaved coded modulation (BICM)-type reconciliation protects all the key bits by forward error correction (FEC), the computational complexity associated with its encoding and decoding can be a bottleneck in achieving a high secret key rate especially for low-cost devices with limited computational capabilities. To alleviate this complexity issue, we propose a new reconciliation scheme that efficiently reduces the complexity by applying FEC only to the least reliable bits (LRBs). We demonstrate by simulations that the proposed information reconciliation based on partial encoding achieves a lower key bit mismatch rate (BMR) than the conventional BICM-type reconciliation even with lower decoding complexity. Furthermore, we provide a lower bound on the asymptotic BMR of the proposed scheme that is useful for estimating the performance in high signal-to-noise ratio (SNR) regimes.
In this paper, we evaluate the effectiveness of secret key extraction from the Received signal strength (RSS) variations on the wireless channel between the two devices for private communication between them. We use real world measurements of RSS in a variety of environments and settings. The results from our experiments with 802.11-based laptops show that 1)An adversary can cause predictable key generation in these static environments, and 2)In dynamic scenarios where the two devices are mobile, high entropy bits are obtained . Building on the strengths of existing secret key extraction approaches, we develop an environment adaptive secret key generation scheme that uses an adaptive Cascade-based information reconciliation and privacy amplification. In our scheme, to provide good scalability in terms of the number of nodes, we utilize a combinatorial design of public-private key pairs, which means nodes combine more than one key pair to encrypt and decrypt messages. We also show that it provides controllable resilience when malicious nodes compromise a limited number of nodes before key revocation and renewal.
Physical layer key generation is one of the promising candidate technology schemes for communication network encryption as it promises to solve the difficulties in traditional cryptographic mechanisms. However, due to the existence of unequal key bits in the process of key generation, the practical application of physical layer key generation is greatly hindered. In this paper, in order to eliminate the key inconsistency problem, we propose a Polar code-based information reconciliation scheme (PIRS) by combining the design mechanism of the 5th generation (5G) physical control channel processing flow in the 5G physical layer protocol. The Monte Carlo simulation results show that our proposed method can significantly reduce the key disagreement rate (KDR) and increase the key generation rate (KGR) for both parties in communication, even when the signal-to-noise ratio is low.
Secure communication in Internet of Things (IoT) devices can be improved through physical-layer secret key generation. In secret key generation, an information reconciliation process is required to match the bit sequences between the two communicating devices. However, this process often involves complex statistical computations that increase system overhead and require the transmission of bits over an insecure public channel. Therefore, this research presents a lightweight reconciliation algorithm based on minimal bit syndrome to reduce overhead and improve key security. The proposed method processes quantized Received Signal Strength (RSS) values into 8-bit block syndrome-based reconciliation mechanism and only the 8-bit syndromes from mismatched block are transmitted over the public channel. System testing was conducted under both static and dynamic scenarios in an indoor area using Raspberry Pi nodes. The results show that the proposed scheme demonstrates an improvement in the Key Generation Rate (KGR) by 2.2% and reduces the processing time by 11.6% in dynamic scenario and 8.3% in the static scenario. Also, the proposed scheme reduce the quantization and reconciliation time by 50% compared to previous research. Furthermore, the proposed method maintained a Key Disagreement Rate (KDR) of 0% across all block size and successfully passed the NIST randomness and complexity test, with all test parameters achieving p-values above 0.01. These result indicate that the proposed scheme improve the performance of existing secret key generation methods and it is suitable for implementation in IoT devices.