A novel pseudo-random number generator based on discrete chaotic iterations
Qianxue Wang, Christophe Guyeux, Jacques M. Bahi

TL;DR
This paper introduces a new pseudo-random number generator based on discrete chaotic iterations, demonstrating its effectiveness and security for internet data encryption and secure image transmission.
Contribution
The paper presents a novel chaos-based pseudo-random number generator using discrete chaotic iterations, which successfully passes standard statistical tests and enhances security for internet communications.
Findings
Successfully passes NIST SP800-22 statistical tests
Exhibits good security characteristics
Applicable for secure internet image transmission
Abstract
Security of information transmitted through the Internet, against passive or active attacks is an international concern. The use of a chaos-based pseudo-random bit sequence to make it unrecognizable by an intruder, is a field of research in full expansion. This mask of useful information by modulation or encryption is a fundamental part of the TLS Internet exchange protocol. In this paper, a new method using discrete chaotic iterations to generate pseudo-random numbers is presented. This pseudo-random number generator has successfully passed the NIST statistical test suite (NIST SP800-22). Security analysis shows its good characteristics. The application for secure image transmission through the Internet is proposed at the end of the paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
