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 Symposium on Wireless Communication Systems

Secret key generation using channel quantization with SVD for reciprocal MIMO channels

Haji Muhammad Furqan, Jehad M. Hamamreh, Hüseyin Arslan

Published Sep 1, 2016• 38 citations
Publisher

Abstract

The generation of secret keys from reciprocal wireless channel by exploiting their randomness nature, is an emerging area of interest to provide secure communication. One of the main challenges in this domain is to increase the secret key length, extracted from the shared channel coefficients between two legitimate communication parties, while maintaining its randomness and uniformity. In this work, we develop a practical key generation method, based on channel quantization with singular value decomposition (CQSVD), which is capable of significantly increasing the generated secret key in MIMO systems. This is achieved through quantizing the phases and amplitudes of the estimated MIMO channel coefficient's matrix by using an alternative form of SVD, where the key sequence is extracted from the orthogonal basis functions of the decomposed channel. In this method, it is shown that for an M ×M antenna system, with M2independent channel fading coefficients, a secret key sequence of length 2M3can be generated. The extracted key sequence is transformed to a random phase sequence, which is then used to manipulate the transmitted data on a symbol level basis rather than bit level-basis, to provide more secure communication. The comparative simulation results show that the proposed CQSVD method outperforms the state of the art secret key generation methods.

DOI
10.1109/iswcs.2016.7600974

Related papers

Key Generation Technique Based on Channel Characteristics for MIMO-OFDM Wireless Communication Systems

Dinh Van Linh, Van Yem Vu

Dynamic secret key generation from wireless channel characteristics is a promising technique for physical layer security. One of the important issues in this field is extending the secret key’s length while preserving its uniformity and randomness. This paper proposes a key generation method based on time-varying and the reciprocity of wireless channels for Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) wireless communication systems. In the proposed technique, the complex impulse response (CIR) of the estimated channel state information (CSI) is extracted, and a quantization algorithm is designed to convert the maximum peaks of the CIR into secret key bits. The effectiveness of the proposed key generation technique is assessed in terms of the randomness of the produced key bits with different key lengths by using a statistical test suite of the National Institute of Standards and Technology (NIST). The proposed technique is employed in the MIMO-OFDM systems with different modulation schemes through Additive White Gaussian Noise (AWGN) and Rayleigh channels. The simulation results show that the secret keys with various key lengths generated from the proposed technique for the MIMO-OFDM systems guarantee randomness. Moreover, the proposed CSI-based key generation technique provides better effectiveness in terms of security when compared to some existing techniques.

IEEE Access•Jan 1, 2023•27 citations

Blind channel estimation based robust physical layer key generation in MIMO networks

Ravi P. Ramachandran, Sachin S. Shetty

An emerging area of interest in wireless security is the generation of secret encryption keys by leveraging the features of the physical propagation channel. The shared randomness of the wireless channel between two legitimate nodes in a communication network is exploited to provide strong secrecy. The secret keys are generated based on fluctuations or evolution of the wireless channel state. However, to the best of our knowledge, little work has been performed on algorithms to exploit the increased randomness available to wireless nodes equipped with MIMO antennas. In this paper, we present a practical key generation scheme for MIMO channels based on quantization performed on blind channel estimates. Our schemes generate random keys for transmitter and receiver by simultaneously quantizing the blind channel estimates. Our schemes are simulated for a realistic fading channel model, and performance metrics for error rate and efficiency are provided.

IEEE International Symposium on Circuits and Systems proceedings•May 1, 2010•3 citations

Secret key establishment using wireless channels as common randomness in time-variant MIMO systems

Chan Chen

Encryption of confidential data with a secret key has become a widespread technique for securing wireless transmissions. However, existing key distribution methods that either deliver the secret key with a key distribution center or exchange the secret key using public-key cryptosystems are unable to establish perfect secret keys necessary for symmetric encryption techniques. This research considers secret key establishment, under the broad research area of information theoretic security, using the reciprocal wireless channel as common randomness for the extraction of perfect secret keys in multiple-input multiple-output (MIMO)communication systems. The presentation discusses the fundamental characteristics of the time-variant MIMO wireless channel and establishes a realistic channel simulation model useful for assessing key establishment algorithms. Computational examples show the accuracy and applicability of the model. The discussion then turns to an investigation of the influence of the spatial and temporal correlation of the channel coefficients on the bound of the key size generated from the common channel, and it is found that a sampling approach exists that can generate a key using the minimum sampling time. A practical key generation protocol is then developed based on an enhancement of a published channel coefficient quantization method that incorporates flexible quantization levels, public transmission of the correlation eigenvector matrix and low-density parity-check (LDPC) coding to improve key agreement. This investigation leads to the development of improved channel quantization techniques that dynamically shift the quantization boundaries at one node based on the information provided by the other node. Analysis based on a closed-form bound for the key error rate (KER) and simulations based on the channel model and measurement data show that the enhanced algorithms are able to dramatically reduce key mismatch and asymptotically approach the KER bound. Finally, other secret key generation algorithms based on channel-encryption rather than quantization are discussed, leading to a new concept for secret key generation using the common wireless channel.

•Jan 1, 2010•3 citations

Secret key generation via random beamforming in stationary environment

Longwang Cheng, Wei Li, Dongtang Ma

Extracting secret key from the common randomness of wireless channel has gained significant interest as a mechanism for providing secure point-to-point communications. Current works focus on the methods of exploiting channel characterizations based on Received Signal Strength Indication (RSSI), channel phase and Channel Impulse Response (CIR) under different propagation environments. However, when the channel fading is static or quasi-static, the secret key bits derived from the channel may be identical or nearly identical. In this paper, we propose a method to solve this problem in multiple-input multiple-output (MIMO) systems based on random beamforming. Compared with single antenna systems, MIMO systems offer more randomness available. Furthermore we consider the worst scenario where the eavesdropper Eve knows perfect knowledge of the legitimate channel. The quantization error probability at Eve is simulated to assess the security of the proposed method.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•15 citations

HIGH RATE SHARED SECRET KEY GENERATION USING THE PHASE ESTIMATION OF MIMO FADING CHANNEL AND MULTILEVEL QUANTIZATION

V Zeinali Fathabadi, Hossein Khaleghi Bizaki, Ali Shahzadi

Much attention has recently been paid to methods of shared secret key generation that exploit the random characteristics of the amplitude and phase of a received signal and common channel symmetry in wireless communication systems. Protocols based on the phase of a received signal, due to the uniform distribution phase of fading channel, are suitable in both static and dynamic environments and, they have a key generation rate (KGR) higher than protocols based on received signal strength (RSS).In addition, previous works have generally focused on key generation protocol for single-antenna (SISO) systems but these have not produced a significant KGR. So in this paper to increase the randomness and key generation rate are used received signal phase estimations on multiple-antenna (MIMO) systems because they have the potential to present more random variables in key generation compared to SISO systems. The results of simulation show that the KGR of the proposed protocol is 4 and 9 times more than the KGR of a SISO system, when the numbers of transmitter and receiver antennas are the same and equal to 2 and 3, respectively. Also, the key generation rate will increase considerably, when to extract the secret key bits using multilevel quantization.

Nashriyyah -i Muhandisi -i Barq va Muhandisi -i Kampyutar -i Iran•Sep 1, 2015•0 citations

Key Generation Algorithms Based on Complex Components of Channel Impulse Response for Massive MIMO Wireless Communication Systems

Dinh Van Linh, Van Yem Vu, Tran Vu Kien +1 more

Physical layer secret key generation is a novel research direction that has attracted many researchers in recent years due to its low computational capacity and ability to obtain information-theoretic security. In this paper, we propose two methods based on the modulus and the real and imaginary parts of the channel impulse response (CIR) matrix to generate a secret key between two legitimate devices in massive Multiple-Input Multiple-Output (MIMO) wireless communication systems. For these methods, the legitimate devices first estimate the channel by using a probing signal to find their CIRs. Next, the CIR matrices are transformed into single-row vectors. The first method uses a simple quantization algorithm to convert the modulus of the complex components of the vector into the final key bit sequence. The second method uses the same quantization algorithm to transform the highest points of the real and imaginary parts into two sequences. The XOR operation between these two sequences generates the final key sequence. The key samples with different lengths generated from the system can be assessed by the most crucial performance metric of randomness according to the National Institute of Standards and Technology (NIST) version 800-22REV1A. The numerical results show that the first method has a higher pass rate and more randomness than the second method. Moreover, our proposed methods are superior to existing methods.

IEEE Access•Jan 1, 2024•4 citations
The generation of secret keys from reciprocal wireless channel by exploiting their randomness nature, is an emerging area of interest to provide secure communication. One of the main challenges in this domain is to increase the secret key length, extracted from the shared channel coefficients between two legitimate communication parties, while maintaining its randomness and uniformity. In this work, we develop a practical key generation method, based on channel quantization with singular value decomposition (CQSVD), which is capable of significantly increasing the generated secret key in MIMO systems. This is achieved through quantizing the phases and amplitudes of the estimated MIMO channel coefficient's matrix by using an alternative form of SVD, where the key sequence is extracted from the orthogonal basis functions of the decomposed channel. In this method, it is shown that for an M ×M antenna system, with M2independent channel fading coefficients, a secret key sequence of length 2M3can be generated. The extracted key sequence is transformed to a random phase sequence, which is then used to manipulate the transmitted data on a symbol level basis rather than bit level-basis, to provide more secure communication. The comparative simulation results show that the proposed CQSVD method outperforms the state of the art secret key generation methods.
Dynamic secret key generation from wireless channel characteristics is a promising technique for physical layer security. One of the important issues in this field is extending the secret key’s length while preserving its uniformity and randomness. This paper proposes a key generation method based on time-varying and the reciprocity of wireless channels for Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing (MIMO-OFDM) wireless communication systems. In the proposed technique, the complex impulse response (CIR) of the estimated channel state information (CSI) is extracted, and a quantization algorithm is designed to convert the maximum peaks of the CIR into secret key bits. The effectiveness of the proposed key generation technique is assessed in terms of the randomness of the produced key bits with different key lengths by using a statistical test suite of the National Institute of Standards and Technology (NIST). The proposed technique is employed in the MIMO-OFDM systems with different modulation schemes through Additive White Gaussian Noise (AWGN) and Rayleigh channels. The simulation results show that the secret keys with various key lengths generated from the proposed technique for the MIMO-OFDM systems guarantee randomness. Moreover, the proposed CSI-based key generation technique provides better effectiveness in terms of security when compared to some existing techniques.
An emerging area of interest in wireless security is the generation of secret encryption keys by leveraging the features of the physical propagation channel. The shared randomness of the wireless channel between two legitimate nodes in a communication network is exploited to provide strong secrecy. The secret keys are generated based on fluctuations or evolution of the wireless channel state. However, to the best of our knowledge, little work has been performed on algorithms to exploit the increased randomness available to wireless nodes equipped with MIMO antennas. In this paper, we present a practical key generation scheme for MIMO channels based on quantization performed on blind channel estimates. Our schemes generate random keys for transmitter and receiver by simultaneously quantizing the blind channel estimates. Our schemes are simulated for a realistic fading channel model, and performance metrics for error rate and efficiency are provided.
Encryption of confidential data with a secret key has become a widespread technique for securing wireless transmissions. However, existing key distribution methods that either deliver the secret key with a key distribution center or exchange the secret key using public-key cryptosystems are unable to establish perfect secret keys necessary for symmetric encryption techniques. This research considers secret key establishment, under the broad research area of information theoretic security, using the reciprocal wireless channel as common randomness for the extraction of perfect secret keys in multiple-input multiple-output (MIMO)communication systems. The presentation discusses the fundamental characteristics of the time-variant MIMO wireless channel and establishes a realistic channel simulation model useful for assessing key establishment algorithms. Computational examples show the accuracy and applicability of the model. The discussion then turns to an investigation of the influence of the spatial and temporal correlation of the channel coefficients on the bound of the key size generated from the common channel, and it is found that a sampling approach exists that can generate a key using the minimum sampling time. A practical key generation protocol is then developed based on an enhancement of a published channel coefficient quantization method that incorporates flexible quantization levels, public transmission of the correlation eigenvector matrix and low-density parity-check (LDPC) coding to improve key agreement. This investigation leads to the development of improved channel quantization techniques that dynamically shift the quantization boundaries at one node based on the information provided by the other node. Analysis based on a closed-form bound for the key error rate (KER) and simulations based on the channel model and measurement data show that the enhanced algorithms are able to dramatically reduce key mismatch and asymptotically approach the KER bound. Finally, other secret key generation algorithms based on channel-encryption rather than quantization are discussed, leading to a new concept for secret key generation using the common wireless channel.
Extracting secret key from the common randomness of wireless channel has gained significant interest as a mechanism for providing secure point-to-point communications. Current works focus on the methods of exploiting channel characterizations based on Received Signal Strength Indication (RSSI), channel phase and Channel Impulse Response (CIR) under different propagation environments. However, when the channel fading is static or quasi-static, the secret key bits derived from the channel may be identical or nearly identical. In this paper, we propose a method to solve this problem in multiple-input multiple-output (MIMO) systems based on random beamforming. Compared with single antenna systems, MIMO systems offer more randomness available. Furthermore we consider the worst scenario where the eavesdropper Eve knows perfect knowledge of the legitimate channel. The quantization error probability at Eve is simulated to assess the security of the proposed method.
Much attention has recently been paid to methods of shared secret key generation that exploit the random characteristics of the amplitude and phase of a received signal and common channel symmetry in wireless communication systems. Protocols based on the phase of a received signal, due to the uniform distribution phase of fading channel, are suitable in both static and dynamic environments and, they have a key generation rate (KGR) higher than protocols based on received signal strength (RSS).In addition, previous works have generally focused on key generation protocol for single-antenna (SISO) systems but these have not produced a significant KGR. So in this paper to increase the randomness and key generation rate are used received signal phase estimations on multiple-antenna (MIMO) systems because they have the potential to present more random variables in key generation compared to SISO systems. The results of simulation show that the KGR of the proposed protocol is 4 and 9 times more than the KGR of a SISO system, when the numbers of transmitter and receiver antennas are the same and equal to 2 and 3, respectively. Also, the key generation rate will increase considerably, when to extract the secret key bits using multilevel quantization.
Physical layer secret key generation is a novel research direction that has attracted many researchers in recent years due to its low computational capacity and ability to obtain information-theoretic security. In this paper, we propose two methods based on the modulus and the real and imaginary parts of the channel impulse response (CIR) matrix to generate a secret key between two legitimate devices in massive Multiple-Input Multiple-Output (MIMO) wireless communication systems. For these methods, the legitimate devices first estimate the channel by using a probing signal to find their CIRs. Next, the CIR matrices are transformed into single-row vectors. The first method uses a simple quantization algorithm to convert the modulus of the complex components of the vector into the final key bit sequence. The second method uses the same quantization algorithm to transform the highest points of the real and imaginary parts into two sequences. The XOR operation between these two sequences generates the final key sequence. The key samples with different lengths generated from the system can be assessed by the most crucial performance metric of randomness according to the National Institute of Standards and Technology (NIST) version 800-22REV1A. The numerical results show that the first method has a higher pass rate and more randomness than the second method. Moreover, our proposed methods are superior to existing methods.