Efficient, perfect polynomial random number generators (Q809536): Difference between revisions

If N is a natural number, let \(P\in {\mathbb{Z}}[x]\) be a polynomial, that is nonlinear on the set \({\mathbb{Z}}_ N\) of integers modulo N. If x is chosen at random in a segment of \({\mathbb{Z}}_ N\), then P(x)(mod N) appears to be uniformly distributed in \({\mathbb{Z}}_ N.\) So, the point of this paper is to construct pseudorandom number generators and the result is that these generators pass any polynomial- time statistical test.