Physical characteristics of wireless communication channels for secret key establishment: A survey of the research

Abstract

Physical layer security protocols have recently been deployed in the context of Wireless communications. These are derived from the intrinsic characteristics of the communication media for key generation, sharing and randomness extraction. These protocols always seek to exhibit both low computational complexity and energy efficiency, whilst also maintain unconditionally secure communications. We present herein, a comprehensive literature review of existing "state-of-the-art" quantisation schemes for physical layer security, with a strong emphasis upon key performance metrics and intrinsic channel characteristics. Our survey seeks not only to concentrate upon the most common quantisation methods, hence their efficiency during key generation; but also crucially, describes the inherent trade-offs as between these standardised metrics. The exact way(s) in which these metrics are duly influenced by quantisation schemes is also discussed, by means of a comprehensive critical narrative of both existing and future developments in the field.

A Noise-Shaped Signaling Method for Vehicle-to-Everything Security

“…Through the results, we verify that an identical sequence can be restored with the same initial and control values. Therefore, we can simplify the sequence sharing process and mitigate the key distribution problem of the conventional cryptography methods [52], [53].…”

Adaptive chaotic map-based key extraction for efficient cross-layer authentication in VANETs

“…Despite the ability of these cross-layer methodologies in increasing the authentication rate, they cannot be effectively used for V2X applications due to the high dynamic behaviour of the moving vehicles, which can cause fluctuations in channel fading between high and low levels in urban and rural areas, posing a challenging scenario [18,29]. Therefore, further research is needed to address this limitation.…”

Memory-Saving and High-Speed Privacy Amplification Algorithm Using LFSR-Based Hash Function for Key Generation

“…Both parties of legal communication, Alice and Bob, can apply the same PA algorithm to map the negotiated key into a shorter unconditional secure secret key in order to delete the information leaked to the eavesdropper Eve. At this time, the key information generated by Eve is almost zero; therefore, Alice and Bob can obtain the same secure unconditional key [1][2][3][4][5].…”