New Enhanced Chaotic Number Generators

TL;DR

This paper presents new chaotic number generators that produce long, high-quality pseudorandom sequences efficiently by using chaotic numbers for sampling, suitable for large-scale applications up to trillions of iterations.

Contribution

The paper introduces novel chaotic number generators that enhance pseudorandom sequence generation by embedding the generating function within the chaotic numbers themselves.

Findings

Generators produce sequences up to 10 trillion iterations

Sequences exhibit high statistical quality

Method effectively conceals the generating function

Abstract

We introduce new families of enhanced chaotic number generators in order to compute very fast long series of pseudorandom numbers. The key feature of these generators being the use of chaotic numbers themselves for sampling chaotic subsequence of chaotic numbers in order to hide the generating function. We explore numerically the properties of these new families and underline their very high qualities and usefulness as CPRNG when series are computed up to 10 trillions iterations.