A Novel Secret Key Generation Algorithm for Secure Wireless Communications
Konferenz: European Wireless 2023 - 28th European Wireless Conference
02.10.2023-04.10.2023 in Rome, Italy
Tagungsband: European Wireless 2023
Seiten: 5Sprache: EnglischTyp: PDF
Autoren:
Jahangeer, Hafsa; Junaid Nawaz, Syed; Wyne, Shurjeel (Department of Electrical and Computer Engineering, COMSATS University Islamabad (CUI), Islamabad, Pakistan)
Ul Haq, Asim (Department of Business Development and Technology, Aarhus university, Herning, Denmark)
Inhalt:
The rapid technological advancements in wireless networks have resulted in tremendous increase in the number of connected user and machine-type wireless devices. Physical Layer Security (PLS) has a strong potential for providing security to wireless links in massively connected future wireless networks. The key-based PLS methods aim at generating secret key bits for data encryption/decryption at the legitimate communication nodes by exploiting the randomness inherent in wireless channels. This work proposes a novel secret key-bits extraction algorithm named Moving-Window Wrapped-Envelope Secret Key Generation (MWWE-SKG). The proposed algorithm uses first-order statistics from a sliding temporal window of channel samples to select the channel quantization interval for each window from circularly wrapped channel envelope samples. The differences in hardware noise conditions at the legitimate nodes lead to differences in the measurement of ideally reciprocal channels, which further leads to a mismatch in the generated secret key bits, whereas the channel statistics of the same links are more likely to remain unchanged for a reasonably large length of time window over the channel samples. An extensive analysis on the performance of the proposed algorithm is conducted, where the proposed algorithm is observed to provide a promising trade-off between the critical SKG performance metrics namely the Key Generation Rate (KGR), Bit Mismatch Probability (BMP), and the Key Randomness Property (KRP). Furthermore, a comparative performance analysis of the proposed algorithm with other notable techniques is also conducted to demonstrate the superior performance of the proposed algorithm.