Some Basic Cryptographic Requirements for Chaos-Based Cryptosystems

By Gonzalo Álvarez, Shujun Li. International Journal of Bifurcation and Chaos in Applied Sciences and Engineering, 2003

1,929 citations recorded by the source corpus.

In recent years, a large amount of work on chaos-based cryptosystems have been published. However, many of the proposed schemes fail to explain or do not possess a number of features that are fundamentally important to all kind of cryptosystems. As a result, many proposed systems are difficult to implement in practice with a reasonable degree of security. Likewise, they are seldom accompanied by a thorough security analysis. Consequently, it is difficult for other researchers and end users to evaluate their security and performance. This work is intended to provide a common framework of basic guidelines that, if followed, could benefit every new cryptosystem. The suggested guidelines address three main issues: implementation, key management and security analysis, aiming at assisting designers of new cryptosystems to present their work in a more systematic and rigorous way to fulfill some basic cryptographic requirements. Meanwhile, several recommendations are made regarding some practical aspects of analog chaos-based secure communications, such as channel noise, limited bandwith and attenuation.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/9ef6c5ef82918e99b560d801c960f4cdeb3bc186

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Zhongyun Hua
2. Yicong Zhou
3. Guanrong Chen
4. Chunhua Wang
5. Hua Chen
6. Yueping Li
7. Shujun Li

In Computer Vision and Pattern Recognition

1. Yicong Zhou
2. Zhongyun Hua
3. Shujun Li
4. Hejiao Huang
5. Kwok-wo Wong
6. Zhiliang Zhu
7. Guanrong Chen
8. Fan Jin

In Statistical and Nonlinear Physics

1. Zhongyun Hua
2. Yicong Zhou
3. Shujun Li
4. Guanrong Chen
5. Zhiliang Zhu
6. Kwok-wo Wong
7. Chunhua Wang
8. Hua Chen

Citations in the corpus

• A RGB image encryption algorithm based on total plain image characteristics and chaos (2015, background): ““To provide a sufficient security against brute-force attacks, the key space size should be 2(100)”, suggested Rule 15 in [39] (2006); in addition, each secret key must be strong, i.”
• 2D Logistic-Sine-coupling map for image encryption (2018, background): “According to the discussion in [46] , the key length of a chaos-based encryption algorithm should be larger than 100 bits to resist brute-force attack.”
• A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks (2008, background): “unately, most of them have been found to be insecure to dierent extents from the viewpoint of modern cryptography [8{16]. For more discussion on chaos-based image encryption schemes, please refer to [17, 18]. In [19], an image permutation algorithm was proposed by scrambling/permuting binary bit of ”
• A hyper-chaos-based image encryption algorithm using pixel-level permutation and bit-level permutation (2017, background): “For an effective cryptosystem, the size of the key space should not be smaller than 2(100) to make brute-force attacks infeasible [42].”
• Exploiting self-adaptive permutation-diffusion and DNA random encoding for secure and efficient image encryption (2018, background): “However, recent research achievements have revealed the fact that traditional block ciphers such as DES, AES are poorly suited for image encryption [1].”
• A chaos-based symmetric image encryption scheme using a bit-level permutation (2011, background): “a[6][6] a[6][7] a[6][8] a[5][1] a[5][2]”
• Image encryption using 2D Logistic-adjusted-Sine map (2016, background): “To resist the brute-force attack, key space of a chaos-based encryption scheme should be larger than 2100 [1].”