A Lightweight Pseudo-Random Number Generator Based on a Robust Chaotic Map
Imad El Hanouti, Hakim El Fadili, Wahid Souhail, Fawad Masood
Abstract
Imad El Hanouti, Hakim El Fadili, Wahid Souhail, Fawad Masood
Abstract
In this paper, we propose a new simple and fast algorithm for entropy extraction and pseudo-random numbers generation from a robust chaotic map. This method could be used as an entropy source in some cryptographic applications. Based on robust chaos and simple operations, the randomness of the generated sequences might be accepted for many security applications. We run a statistical randomness test-suite on some randomly generated sequences to evaluate their randomness.
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose a new simple and fast algorithm for entropy extraction and pseudo-random numbers generation from a robust chaotic map. This method could be used as an entropy source in some cryptographic applications. Based on robust chaos and simple operations, the randomness of the generated sequences might be accepted for many security applications. We run a statistical randomness test-suite on some randomly generated sequences to evaluate their randomness.
Key concepts: Randomness, Random number generation, Computer science, Chaotic, Randomness tests, Cryptography, Entropy (arrow of time), Algorithm