Fast secret key-sharing method based on channel information and chaos randomization
Takumi Abe, Keisuke Asano, Kenta Kato, Eiji Okamoto, Tetsuya Yamamoto · IEICE Communications Express · 2023
Recently, physical layer security has attracted increased attention. In this context, researchers have proposed secret key-sharing methods using time-varying channel state information (CSI). However, CSI is time-correlated; thus, the randomness of the key deteriorates when the key generation time is shortened. Accordingly, we propose a 256-bit secret key-sharing method that does not degrade the key randomness even when the generation time is shortened. The method is based on exploiting chaos signals exhibiting complex and unpredictable behaviors. Through numerical simulations, we demonstrate that the proposed method passes the randomness evaluation test provided by the National Institute of Standards and Technology in a short time.