A spatiotemporal chaotic system based on pseudo-random coupled map lattices and elementary cellular automata

Dong, Youheng; Zhao, Geng

doi:10.1016/j.chaos.2021.111217

Cited by 14 publications

(3 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Kolmogorov-Sinai entropy density (KED) and breadth (KEB) [43,44] are important indicators to measure the chaotic strength of an SC model based on the CML. They are closely related to the Lyapunov exponent (LE).…”

Section: B Kolmogorov-sinai Entropymentioning

confidence: 99%

A Novel Spatiotemporal Chaotic Model with Provable Security

Dong

Zhao

Tse

et al. 2023

Preprint

Self Cite

View full text Add to dashboard Cite

In the application of chaos in cryptography, two questions remain unanswered: Does the chaos-based cipher possess provable security? Can the reproduction of a chaotic model or chaotic sequence be specified as a non-deterministic polynomial complete(NPC) problem or non-deterministic polynomial hard(NPH) problem for cryptanalysts? This paper proposes a spatiotemporal chaotic model called pseudo-random scrambling coupled map lattice (PRSCML) based on the coupled map lattice (CML) and the hybrid elementary cellular automata with a mask (HECA-M). This model can answer the above two questions affirmatively. The experiments reveal the strong chaotic properties of the PRSCML model, including the high Kolmogorov-Sinai entropy, randomness, and ergodicity. Furthermore, the sequences generated by PRSCML are backward and forward secure as the reproduction of a PRSCML model and its sequence are equivalent to the traveling salesman problem (TSP), which is an NPH problem. Meanwhile, the recurrence of a HECA-M belongs to the regular 3-SAT problem, which is an NPC problem. Therefore, the PRSCML model possesses provable security, and its superior performance demonstrates that it has great potential for cryptography. Moreover, this paper can reassure researchers that the security of some chaos-based ciphers can be confirmed for cryptography.

show abstract

Section: B Kolmogorov-sinai Entropymentioning

confidence: 99%

A Novel Spatiotemporal Chaotic Model with Provable Security

Dong

Zhao

Tse

et al. 2023

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…50 Where chaotic iteration is a convergence theorem that could be useful for generating chaos, proposed by Devaney et al 51 In another study, a combination of CML system and elementary cellular automata has been used in construction of a PRNG. 52 CMLs are classified as spatio-temporal systems, in which the dimensions of the system could be controlled by specifying the lattice count. There are yet other characteristics of CML systems that need to be explored.…”

Section: Related Workmentioning

confidence: 99%

“…Xing et al proposed an idea for a PRNG based on CML systems in conjunction with chaotic iteration 50 . Where chaotic iteration is a convergence theorem that could be useful for generating chaos, proposed by Devaney et al 51 In another study, a combination of CML system and elementary cellular automata has been used in construction of a PRNG 52 …”

Section: Related Workmentioning

confidence: 99%

A resource efficient pseudo random number generator based on sawtooth maps for Internet of Things

Zia

McCartney

Scotney

et al. 2023

Security and Privacy

View full text Add to dashboard Cite

The strength of cryptographic keys rely on the random number generators (RNGs) to produce random seed values. Unfortunately there are not many RNGs options suitable for Internet of Things (IoTs) scenario, due to limited processing resources and bulk quantity of IoT data that needs to be secured. In this article, we studied sawtooth map which is a chaotic map. However, when implemented on a computer, the sawtooth map results on a non‐chaotic orbit due to the finite precision of computation. This can be avoided if we use the sawtooth map as the local map in a coupled map lattice (CML) system. We explore such coupled map systems for randomness through entropy and statistical analysis. Based on the results, we propose a lightweight hybrid pseudo random number generator (PRNG) based on sawtooth based CML system and SPONGENT hashing. The proposed PRNG is thoroughly tested against statistical attacks, entropy analysis, key space analysis and compared with existing state of the art solutions. The results provide evidence that the proposed PRNG produces random numbers that could produce sufficiently strong cryptographic keys for resource constrained IoT devices.

show abstract