Weak key analysis for chaotic cipher based on randomness properties

Abstract

Weak key analysis is a key issue in the design of chaotic ciphers. While most of the existing research focusing on the degradation of the chaotic sequences which causes weak keys, we point out that the parameters for which the chaotic sequences do not degrade are still possible to be weak keys. In this paper, we propose a new approach based on the rigorous statistical test to improve the weak key analysis. The weak keys of a specific chaotic cipher are investigated by using our method and a large number of new weak keys are detected. These results verify that our method is more effective. On the other hand, although statistical tests are now widely adopted to test the chaos-based bit sequences, there are few reports of analysis results on the weak keys or weak sequences of chaotic cipher. Thus our work may be helpful for current research on statistical tests of chaotic cipher.

A novel method of constructing high-dimensional digital chaotic systems on finite-state automata*

“…Chaos has aroused wide concerns because of its simple structure and complex dynamical properties, such as sensitivity to initial conditions, inner randomness in the definitive systems, aperiodicity, and unpredictability. [1,2] Such properties exactly meet the requirements of cryptography, [3,4] so chaotic systems have been widely used in many different secure encryption systems, [5][6][7][8] including digital ciphers, pseudorandom number generator (PRNG), and so on. However, when chaotic systems are implemented on digital devices with finite computing precisions, they cannot preserve the desired dynamics and degrade of varying degrees.…”

A new discrete Fourier transform randomness test

“…It can not only evaluate the outputs of RNGs, but also assess the randomness of cryptographic system's outputs [2]. What's more, statistical randomness test can be employed to analysis the internal states of cryptographic algorithms [3,4], so the weakness of the cryptographic algorithms can be found. There exist a number of commonly used statistical test suites: Marsaglia's Diehard 1) , CryptXS 2) , SP800-22 [5] published by US NIST (National Institute of Standards and Technology).…”

Different Random Distributions Research on Logistic‐Based Sample Assumption

“…During these two decades, researches on chaos almost divide into four parts, namely, chaotic synchronization [1,2], chaotic control [3,4], chaotic secure communication [5,6], and chaotic characteristics with cryptography [7,8]. For the researches on chaotic signal, there are also a lot of papers, devoted to study the characteristics of chaotic sequences, which focused on its complicacy, weak key analysis, statistical or randomness tests, and so forth [9][10][11][12], and they also paid much attention to self-or cross-correlation so that a new improved chaotic signal can be made [13]. All of their studies have significant contributions to studying and using chaos indeed.…”