A key generation scheme based on precoding and cooperation matrix (PCM-SKG) is proposed to address the issues of poor randomness of physical layer keys and vulnerability to eavesdropping in a quasi-static environment. First, the precoding matrix P is obtained via singular value decomposition (SVD) of the channel state information. Then, the cooperative matrix U is derived via orthogonal triangular (QR) decomposition of the precoded channel information. Finally, the composite channel information HPU, is utilized to quantify the secret key. Simulation results show that the approximate key entropy of the PCM-SKG increases nearly two times compared to traditional schemes, while the sliding average step improves key consistency by approximately 8 dB. In minimum mean square error (MMSE) estimation, the key mismatch rate of this scheme is close to 10-4 at 15 dB, with the communication error rate approaching optimal system performance. The PCM-SKG features low complexity and minimal interactive information, requiring no additional channels or devices for information transmission. By leveraging the diversity of the precoding and cooperative matrices, it achieves a key generation random source that is correlated with and variable to the channel.
A key generation scheme based on precoding and cooperation matrix (PCM-SKG) is proposed to address the issues of poor randomness of physical layer keys and vulnerability to eavesdropping in a quasi-static environment. First, the precoding matrix P is obtained via singular value decomposition (SVD) of the channel state information. Then, the cooperative matrix U is derived via orthogonal triangular (QR) decomposition of the precoded channel information. Finally, the composite channel information HPU, is utilized to quantify the secret key. Simulation results show that the approximate key entropy of the PCM-SKG increases nearly two times compared to traditional schemes, while the sliding average step improves key consistency by approximately 8 dB. In minimum mean square error (MMSE) estimation, the key mismatch rate of this scheme is close to 10-4 at 15 dB, with the communication error rate approaching optimal system performance. The PCM-SKG features low complexity and minimal interactive information, requiring no additional channels or devices for information transmission. By leveraging the diversity of the precoding and cooperative matrices, it achieves a key generation random source that is correlated with and variable to the channel.
Physical layer secret key generation exploits the reciprocal channel randomness for key generation and has proven to be an effective addition security layer in wireless communications. However, static or scarcely random channels require artificially induced dynamics to improve the secrecy performance, e.g., using intelligent reflecting surface (IRS). One key challenge is that the induced random phase from IRS is also reflected in the direction to eavesdroppers (Eve). This leakage enables Eve nodes to estimate the legitimate channels and secret key via a globally known pilot sequence. To mitigate the secret key leakage issue, we propose to exploit random matrix theory to inform the design of a new physical layer secret key generation (PL-SKG) algorithm. We prove that, when sending appropriate random Gaussian matrices, the singular values of Alice's and Bob's received signals follow a similar probability distribution. Leveraging these common singular values, we propose a random Gaussian matrix based PL-SKG (RGM PL-SKG), which avoids the usages of the globally known pilot and thereby prevents the aforementioned leakage issue. Our results show the following: (i) high noise resistance which leads to superior secret key rate (SKR) improvement (up to 300%) in low SNR regime, and (ii) general improved SKR performance against multiple colluded Eves. We believe our combination of random matrix theory and PL-SKG shows a new paradigm to secure the wireless communication channels.
Physical layer key generation in multi-user multiple-input multiple-output (MU-MIMO) system is challenging due to the poor randomness of the equivalent channel response. The precoding matrix combines the channels from different antennas in a constructive way, resulting in a flat fading equivalent channel. In this paper, we proposes new physical layer key generation schemes based on precoding adjustment. Two strategies are proposed to enhance the randomness of the equivalent channel response at the cost of beamforming gain, which consist in adjusting random elements and adjusting the largest elements. When considering the transmission of artificial noise (AN) at the base station, random phase adjustment strategy is proposed to the precoding scheme which does not affect the beamforming gain. The signal-to-interference-plus-noise ratio of user and key generation performance are simulated. Simulation results show that adjusting the precoding elements with larger amplitudes is more efficient to increase the information entropy of the channel response. When the system is able to transmit an AN with high power ratio, random phase adjustment can help to generate secret keys with higher information entropy compared to two other strategies.
In static or quasi-static wireless channel environments, secret key generation (SKG) based on wireless channels is vulnerable to active attacks due to the openness and invariance of public pilot, especially man-in-the-middle (MITM) attacks, where attacker acts as a transparent relay to manipulate channel measurements and derive the generated keys. In order to fight against this attack, a dynamic private pilot is designed, where both private pilot and secret key are derived from the characteristics of wireless channels and private to third party. In static or quasi-static environments, we use singular value decomposition techniques to reconstitute the wireless channels to improve the randomness of the wireless channels. Private pilot can encrypt and authenticate the wireless channels, which can make channel state information intercepted by MITM attacker reduced to zero and the SKG rate close to that without attacks. Results of analysis and simulation show the proposed SKG scheme can withdraw the MITM attacks.
Physical-layer secret key generation (PKG) is an emerging technique to address the secret key distribution problem and precoding matrix index (PMI)-based PKG approaches can thwart eavesdropping attempts. However, existing PKG schemes based on PMI only considered square channel matrices, which restricts the practical application. In this paper, we propose a new PKG scheme called NS-PMI-PKG which can yield secret keys for non-square channel matrices in time-division duplex (TDD) mode. Specifically, NS-PMI-PKG includes two vital steps, i.e., codebook generation and detection. First, the codebook generation approach ensures a unitary precoding matrix by applying singular value decomposition (SVD) to the precoding matrix. Second, we present an efficient codebook detection approach leveraging the properties of unitary matrices and the concept of template matching. Subsequently, we present a theoretical analysis of the proposed NS-PMI-PKG scheme from the aspects of key generation correctness, security, and efficiency. The simulation results demonstrate that the proposed scheme exhibits good key generation performance when the channel matrix is non-square. At the signal-to-noise ratio (SNR) of 25 dB, the bit error rate (BER) of the proposed scheme is approximately an order of magnitude lower than that of the baseline scheme. In addition, the eavesdropper struggles to obtain any keys when 2 meters away from the legitimate user, and even when sufficiently close, can acquire at most half the keys. Also, the generated key exhibits good randomness, enhancing its resistance to brute force cracking.
This paper investigates an artificial randomness-based key generation scheme in near-field extremely large-scale multiple-input multiple-output (XL-MIMO) communications, aiming to overcome the limitations of static wireless chan-nels in generating secret keys. The proposed approach introduces artificial randomness via the pre coding vector, enabling legitimate users to generate secret keys while preventing eavesdropping. To maximize the secret key rate (SKR), the singular value decomposition (SVD) method is utilized to identify the legitimate subspace for generating secret keys and its orthogonal subspace to thwart eavesdropping. Additionally, a Dinkelbach method-based power allocation algorithm is designed to inject noise into both the legitimate subspace and its orthogonal subspace. Our simulation results validate the efficiency of the proposed key generation scheme, demonstrating its superiority over existing approaches.
In secret key generation (SKG), both communicating parties require access to a reciprocal entropy source. Free-space communication fails to provide this due to its strong line-of-sight (LoS) link and absence of multipath scattering. In general, in a free-space environment, SKG faces two primary challenges: a low key generation rate (KGR) and heightened security threats due to a lack of spatial decorrelation. In static free-space environments, the lack of temporal variation further exacerbates challenges. This paper aims to identify and enhance techniques from SKG literature to enable a location-based approach for secure key establishment. Important solutions include exploiting channel phase information as a common measurable parameter, adopting mutual random phase injection to involve the eavesdropper in the eavesdropping process while improving KGR, and introducing geometric secrecy as a security evaluation framework. A principal design objective in geometric secrecy is reducing the vulnerability region to restrict eavesdropping opportunities. To accomplish this, we propose a cooperative key generation (CKG) scheme to shrink this region. In our proposed CKG scheme, the sampling time is primarily governed by the switching time between transmit and receive modes. For information reconciliation, a selection algorithm for a shortened Bose–Chaudhuri–Hocquenghem (SBCH) code is proposed, and SBCH combined with a cyclic redundancy check (CRC) corrects bit mismatches. Worst-case channel sampling and information reconciliation leakage rates are analyzed. The leftover hash lemma is applied during privacy amplification to render leaked information useless. Simulation results indicate that the proposed CKG scheme achieves enhanced effectiveness with increased the number of quantization levels, while a wider angular guard zone plays a critical role in improving the KGR.