Cryptanalysis of a one round chaos-based Substitution Permutation Network
This work identifies critical flaws in chaotic cryptography, which is important for cryptographers and security researchers, but it is incremental as it critiques an existing proposal.
The paper analyzes a recent chaotic cryptosystem based on a one-round Substitution Permutation Network, showing that incorporating a chaotic system does not resolve the security issues inherent in this encryption architecture.
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.