Pseudo Random test of prime numbers
From MaRDI portal
Publication:6476891
arXivmath/0603450MaRDI QIDQ6476891FDOQ6476891
Authors: Wang Liang, Huang Yan 
Publication date: 18 March 2006
Abstract: The prime numbers look like a randomly chosen sequence of natural numbers, but there is still no strict theory to determine 'Randomness'. In these years, cryptography has developed a battery of statistical tests for randomness. In this paper, we just apply these methods to study the distribution of primes. Here the binary sequence constructed by second difference of primes is used as samples. We find this sequence can't reach all the 'random standard' of FIPS 140-1/2, but still show obvious random feature. The interesting self-similarity is also observed in this sequence. These results add the evidence that prime numbers is a chaos system.
This page was built for publication: Pseudo Random test of prime numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476891)
