A Valid Algorithm of Converting Chaos Sequences to Uniformity Pseudo-random Ones

This article presents a universally valid algorithm designed for homogenizing chaos-based pseudo-random number generators (PRNG). The implementation of this algorithm is based on shifting-bit operations which are represented by floating-point numbers on computers, not aiming at material chaotic systems. Logistic map, Henon map and Lorenz system are applied to test the algorithm, and all the tests indicate that the algorithm is correct respectively. Therefore, we can reasonably expect that this algorithm could become a standardized modular design of chaotic PRNGs in hardware implementation.