{'fraction_non_alphanumeric': 0.019625334522747548, 'fraction_numerical': 0.0, 'mean_word_length': 5.6, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
High secure sequence design in frequency hopping communications

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.