This article presents a configurable, high-throughput pseudo-random number generator template targeting cryptographic applications. The template is parameterized using a chaotic map that generates data, an entropy builder that is used to periodically change the parameters of the map and a parameter change interval, which is the number of iterations after which the entropy builder will change the generator’s parameters. The system is implemented in C++ and evaluated using the TestU01 and NIST RNG statistical tests. The same implementation is used for a stream cipher that can encrypt and decrypt PNG images. A Monte-Carlo analysis of the seed space was performed. Results show that for certain combinations of maps and entropy builders, more than 90% of initial states (seeds) tested pass all statistical randomness tests. Also, the throughput is large enough so that a 8 K color image can be encrypted in 2 s on a modern laptop CPU (exact specifications are given in the paper). The conclusion is that chaotic maps can be successfully used as a building block for cryptographic random number generators.
This paper presents an improved image encryption algorithm using Haar wavelet packets decomposition and four chaotic maps. For the wavelet packets scrambling we propose a permutation based on the Baker chaotic map. To increase the entropy of the ciphered image and the key space of the cryptosystem two chaotic maps – the three-dimensional Arnold map, applied twice, and the tent map combined with the logistic map – are used. Matlab simulations show that, in each step, these chaotic maps increase the entropy of the encrypted images and the pixels’ decorrelation. Another benefit obtained using the four maps is the augmentation of the key space.
This paper presents an efficient encryption algorithm based on 3 chaotic systems. Initially, the Bogdanov chaotic system is used to scramble the original image, in order to complicate the cryptanalysis of the cipher, followed by a number of iterations of encryption with tent map. The parameters of each iteration of the tent map encryption are generated by the chaotic logistic map transformation after going through the transient regime (entering stationarity). The key of the algorithm is composed of the individual keys of each chaotic transformation.
The novelty of this work is the statistical perspective of the cryptanalyst being able to perform a chosen plaintext attack on a private communication scheme involving chaos-based algorithms. The attacker finds himself in the position of analyzing the pseudo-random matrix that was used for encryption. The contribution is done in the context of the well-known fields of secret-key cryptology and that of wavelet packet decomposition of images. The analysis is exemplified on the thoroughly investigated, in the existing literature, simplest chaotic system, the logistic map. Kolmogorov-Smirnov tests, histogram testing, autocorrelation functions and nonlinear singular value decomposition are used. In addition, a new enciphering wavelet-based algorithm is proposed and analyzed.
This paper proposes an encryption algorithm for speech signals based on the discrete wavelet transform and a new chaotic map composed by three chaotic systems: Sine-Cubic-Tent chaotic map. The results of the encryption with the composite chaotic map are compared with the results obtained with each chaotic system. The metrics obtained with this new chaotic map are very good in terms of robustness and speed.
We propose and analyse a hybrid chaotic pseudorandom generator that combines the logistic, tent, and Hénon maps under a deterministic entropy-greedy selector. At each step every map proposes a candidate; the selector keeps the one that maximises the plug-in Shannon entropy of a sliding output window, emits it, and advances only the winning map’s state. We benchmark all four generators plus a Mersenne Twister (MT19937) reference on uniformity (Kolmogorov–Smirnov statistic, KS), lag-correlation, entropy, Lyapunov exponent, and sensitivity. The hybrid reduces the logistic KS deviation by and the maximum short-lag Pearson correlation by . An explicit predictability analysis shows that the logistic and tent states are exposed, giving an adversary one-step accuracy; only the hidden Hénon coordinate blocks free-running cloning, which diverges within about eight steps. Rank-uniformisation drops KS to and passes a NIST SP 800-22 subset, while the lag-1 rank dependence is unchanged. Structural modifications—state masking for all component maps and continuous-time replacements with hidden coordinates—are discussed as routes to reducing predictability.