A novel chaotic generator based on weakly-coupled discrete skewtent maps

Abstract

In this paper, we propose a novel pseudo chaotic random number generator based on three weakly-coupled discrete Skew tent maps. Its implementation was performed with C language and finite precision N=32, including a chaotic multiplexing technique. We show that our approach permits to avoid dynamic degradation caused by finite precision in one hand, and to allow emergence from chaos toward randomness in the other hand. As a consequence, the proposed generator turns out to be secure against famous cryptographic and statistical attacks. Several statistical tests such as correlation, histogram, chi2 and NIST have been applied on the generated sequences. They confirm the robustness of this chaotic generator.

Comparative study of two pseudo chaotic number generators for securing the IoT

“…The results obtained in tables I, II, III, show that the PCNG2 has better computing performance than PCNG1. Besides, these computing performance are better than some known pseudo-random number generators of the literature: Jallouli et al [7], François et al [9], QUANTIS [10] and Blum Blum Shub [11].…”

Robust chaos-based stream-cipher for secure public communication channels

“…(2) Where F p[Xp(n − 1)] and F s[Xs(n − 1)] are the discrete functions of the chaotic maps Pwlcm and Skew Tent maps respectively [18].…”