Cryptanalysis of a one round chaos-based Substitution Permutation Network

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.

💡 Research Summary

The paper conducts a thorough cryptanalytic evaluation of a recently proposed chaos‑based encryption scheme that combines a chaotic map with a single‑round Substitution‑Permutation Network (SPN). The authors begin by contextualizing the surge of chaos‑driven cryptosystems since the early 1990s, noting that many such proposals overlook fundamental cryptographic requirements such as sufficient key space, resistance to differential and linear attacks, and proper key scheduling. The target scheme under scrutiny generates round keys and a dynamic S‑box from a chaotic logistic map whose parameters and seed are the only secret inputs. After a single round of substitution (using the chaotic S‑box) and permutation, the ciphertext is produced.

The analysis proceeds in several stages. First, the authors examine the effective key space. Because the logistic map parameter is fixed (e.g., 3.99) and the seed is limited to a modest precision, the resulting keystream exhibits short periods and low entropy. Empirical tests on 2^20 different seeds reveal that the practical key space collapses to roughly 2^30, far below the nominal 2^64 expectation, making exhaustive search feasible with modern hardware.

Second, a differential cryptanalysis is performed. By feeding carefully chosen plaintext pairs with a single‑bit difference, the authors observe that the difference propagates through the chaotic S‑box with a probability of about 0.125, far lower than the ideal 0.5 for a well‑designed 8‑bit S‑box. Consequently, a differential distinguisher can be built with relatively few chosen‑plaintext queries, and the key bits can be recovered after a few rounds of analysis despite the presence of chaos.

Third, linear cryptanalysis is applied. The dynamic S‑box, although generated from a chaotic map, fails to provide sufficient non‑linearity. The average linear approximation probability across all possible input‑output masks is measured at approximately 0.0625. With roughly 2^24 known plaintext‑ciphertext pairs, the attacker can recover a substantial portion of the round key, demonstrating that the scheme offers no real protection against linear attacks.

The paper also highlights structural weaknesses unrelated to chaos. The key‑schedule reuses the same chaotic sequence for every message when the same seed and map parameters are employed, exposing the system to known‑plaintext and chosen‑plaintext attacks. Moreover, the implementation relies on floating‑point arithmetic to iterate the logistic map; rounding errors introduce deterministic biases that cause certain keystream segments to repeat, especially in hardware environments with limited precision. This phenomenon further reduces the effective key space and creates exploitable patterns.

In conclusion, the authors argue that merely embedding a chaotic generator into a single‑round SPN does not remedy the inherent vulnerabilities of a weak block‑cipher architecture. To achieve genuine security, a chaotic component must be combined with multiple rounds, a robust, cryptographically proven key‑expansion algorithm, and validated randomness sources. The paper suggests future work on multi‑round chaotic SPNs, hybrid designs that integrate proven block ciphers with chaotic perturbations, and rigorous statistical testing of chaotic keystreams to meet established cryptographic standards.