About polynomial-time “unpredictable” generators

@inproceedings{LEcuyer1989AboutP,
  title={About polynomial-time “unpredictable” generators},
  author={Pierre L'Ecuyer and Ren{\'e} Proulx},
  booktitle={WSC '89},
  year={1989}
}
So-called "perfect" or "unpredictable" pseudorandom generators have been proposed recently by people from the area of cryptology. Many people got aware of them from an optimistic article in the New York Times (Gleick (1988)). These generators are usually based on nonlinear recurrences modulo some integer m. Under some (yet unproven) complexity assumptions, it has been proven that no polynomial-time statistical test can distinguish a sequence of bits produced by such a generator from a sequence… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Efficient and Portable Combined Random Number Generators

  • Commun. ACM
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Unique Extrapolation of Polynomial Recurrences

P. L'Ecuyer
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…