High Secure Sequence Design in Frequency Hopping Communications

作     者：Rui Chen Zan Li Jia Shi Lei Guan Jiankang Zhang 

作者机构：School of Telecommunications Engineering Xidian University School of Electronics and Computer Science University of Southampton 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2019年第16卷第4期

页      面：139-150页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0839[工学-网络空间安全] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported in part by the National Natural Science Foundation of China (No.61631015 and 61501354) 

主　　题：frequency-hopping sequence cryptographic algorithm security randomness complexity 

摘      要：Frequency-hopping(FH) technique is widely used in high-secure communications by exploiting its capabilities of mitigating interference and confidentiality. However, electronic attacks in wireless systems become more and more rigorous, which poses huge challenges to the use of the number theory based and chaos theory assisted sequences. The structure of the FH sequence directly affects the performance of FH communication systems. In this paper, the novel FH sequence generation scheme is proposed with the aid of the so-called Government Standard(GOST) algorithm, which achieves a promising balance between efficiency and security. Moreover, the security performance of the proposed algorithm is analyzed, which reveals that it is more resistant to impossible differential attacks than the widely-used Data Encryption Standard(DES) algorithm. The numerical results show that the FH sequences generated by the GOST algorithm significantly outperform the ones generated by the DES algorithm and chaotic theory in terms of the randomness and complexity.