Cryptanalysis of a one round chaos-based Substitution Permutation Network
arXiv:1203.6866 · doi:10.1016/j.sigpro.2012.11.019
Abstract
The interleaving of chaos and cryptography has been the aim of a large set of works since the beginning of the nineties. Many encryption proposals have been introduced to improve conventional cryptography. However, many proposals possess serious problems according to the basic requirements for the secure exchange of information. In this paper we highlight some of the main problems of chaotic cryptography by means of the analysis of a very recent chaotic cryptosystem based on a one round Substitution Permutation Network. More specifically, we show that it is not possible to avoid the security problems of that encryption architecture just by including a chaotic system as core of the derived encryption system.
References in corpus (6)
- Optimal quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks
- On the security of a new image encryption scheme based on chaotic map lattices
- Cryptanalysis of an image encryption scheme based on a new total shuffling algorithm
- Breaking a Chaotic Cryptographic Scheme Based on Composition Maps
- Cryptanalysis of a family of self-synchronizing chaotic stream ciphers
- On the inadequacy of the logistic map for cryptographic applications
Cited by in corpus (6)
- On the cryptanalysis of Fridrich's chaotic image encryption scheme
- Cryptanalyzing an Image-Scrambling Encryption Algorithm of Pixel Bits
- Construction and Optimization of TRNG Based Substitution Boxes for Block Encryption Algorithms
- On the security of a class of diffusion mechanisms for image encryption
- Chosen-plaintext attack of an image encryption scheme based on modified permutation-diffusion structure
- Randomness Evaluation of a Genetic Algorithm for Image Encryption: A Signal Processing Approach