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.
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.
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.
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.
ABSTRACT This work proposes a secret key extraction technique from the complex impulse response (CIR) for secure orthogonal frequency division multiplexing (OFDM) wireless communication systems. Using time division duplexing (TDD), the legitimate transceivers exchange pilot tones within the channel coherence time to estimate their CIRs, from which the dominant peaks are selected and quantised into binary sequences using a mean‐referenced Heaviside rule. Simulations are conducted in MATLAB for OFDM systems over Additive White Gaussian Noise (AWGN) and Rayleigh fading channels with Binary Phase Shift Keying (BPSK) and Quadrature Phase Shift Keying (QPSK) modulation schemes. The proposed method is evaluated in terms of randomness, key disagreement rate (KDR), and key generation rate (KGR). For key lengths of 128 bits, 100,000 bits, and 1,000,000 bits, the generated key sequences pass 8, 9 and 15 tests, respectively, in the National Institute of Standards and Technology (NIST) statistical test suite, with all p ‐values greater than 0.01. Since the simulations are performed under ideal reciprocal channel conditions, the keys generated by the two legitimate users are identical, resulting in a KDR of 0 prior to any reconciliation process. In addition, because 16 dominant CIR peaks are extracted from each realisation and each peak contributes one bit, the proposed method achieves a constant KGR of 16 bits per CIR realisation. The results show that the proposed scheme provides a scalable and deterministic key generation mechanism with strong randomness, zero disagreement in simulation, and controllable generation efficiency.
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.
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.
As a new way to enhance wireless communication security, secret key generation based on physical layer channel characteristics has emerged. In this paper, we propose a novel secret key generation algorithm based on wireless channel characteristics for orthogonal frequency division multiplexing (OFDM) communication systems. The mean quantization algorithm is applied to quantize the real part and imaginary part of OFDM subcarriers, respectively, which can significantly increase the length of the generated secret key in the OFDM system. To reduce the consistency between the secret keys generated by the eavesdropper and the legitimate communication nodes, a processing method by taking the subcarrier phase as initialization of a scrambling code and scrambling the quantized result is proposed. The simulation and test results show that compared with the existing research, the proposed algorithm can improve the key generation rate (KGR), reduce the key mismatch rate (KMR) and complexity, maintain high randomness, and disturb the eavesdroppers.