Pseudo random number generator based on quantum chaotic map

• A novel pseudo-random number generator (PRNG) based on quantum logistic map is presented.
• The Scale index analysis shows the generated sequence is more non-periodic.
• The proposed PRNG is subjected to statistical tests using the well-known tests suites.
• The PRNG successfully passed all statistical tests of the test suites for all runs.
• There is no post-processing procedure which makes it an extremely simple generator.

For many years dissipative quantum maps were widely used as informative models of quantum chaos. In this paper, a new scheme for generating good pseudo-random numbers (PRNG), based on quantum logistic map is proposed. Note that the PRNG merely relies on the equations used in the quantum chaotic map. The algorithm is not complex, which does not impose high requirement on computer hardware and thus computation speed is fast. In order to face the challenge of using the proposed PRNG in quantum cryptography and other practical applications, the proposed PRNG is subjected to statistical tests using well-known test suites such as NIST, DIEHARD, ENT and TestU01. The results of the statistical tests were promising, as the proposed PRNG successfully passed all these tests. Moreover, the degree of non-periodicity of the chaotic sequences of the quantum map is investigated through the Scale index technique. The obtained result shows that, the sequence is more non-periodic. From these results it can be concluded that, the new scheme can generate a high percentage of usable pseudo-random numbers for simulation and other applications in scientific computing.