Inferring sequences produced by pseudo-random number generators
- 1 January 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 36 (1), 129-141
- https://doi.org/10.1145/58562.59305
Abstract
In this paper, efficient algorithms are given for inferring sequences produced by certain pseudo-random number generators. The generators considered are all of the form X n = Σ k j-l α j φ j ( X o , X l , . . ., X n-l ) (mod m ). In each case, we assume that the functions φ j are known and polynomial time computable, but that the coefficients aj and the modulus m are unknown. Using this general method, specific examples of generators having this form, the linear congruential method, linear congruences with n terms in the recurrence, and quadratic congruences are shown to be cryptographically insecure.Keywords
This publication has 6 references indexed in Scilit:
- Unique Extrapolation of Polynomial RecurrencesSIAM Journal on Computing, 1988
- Inferring a Sequence Generated by a Linear CongruencePublished by Springer Science and Business Media LLC ,1983
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- “CRACKING” A RANDOM NUMBER GENERATORCryptologia, 1977
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- XV. On systems of linear indeterminate equations and congruencesPhilosophical Transactions of the Royal Society of London, 1861