How to predict congruential generators
References (22)
- et al.
On the power of two-point based sampling
J. Complexity
(1989) - et al.
RSA and Rabin functions: Certain parts are as hard as the whole
SIAM J. Comput.
(1988) Realistic analysis of some randomized algorithms
Inferring sequences produced by pseudo-random number generators
J. Assoc. Comput. Mach.
(1989)- et al.
How to generate cryptographically strong sequences of pseudo-random bits
SIAM J. Comput.
(1984) - et al.
A simple unpredictable pseudo-random number generator
SIAM J. Comput.
(1986) - et al.
Systems of linear congruences
Can. J. Math.
(1955) Systems of distinct representatives and linear algebra
J. Res. Nat. Bur. Stand. (B)
(1967)- et al.
Reconstructing truncated integer variables satisfying linear congruences
SIAM J. Comput.
(1988) - et al.
On the existence of pseudorandom generators
Pseudo-random generation from one-way functions
Cited by (55)
On the Carlitz rank of permutations of <sup>Fq</sup> and pseudorandom sequences
2014, Journal of ComplexityThe Carlitz rank of permutations of finite fields: A survey
2014, Journal of Symbolic ComputationOn pseudorandom numbers from multivariate polynomial systems
2010, Finite Fields and their ApplicationsEvaluation of splittable pseudo-random generators
2015, Journal of Functional ProgrammingQuantum attacks on pseudorandom generators
2013, Mathematical Structures in Computer ScienceRECONSTRUCTING POINTS OF SUPERELLIPTIC CURVES OVER A PRIME FINITE FIELD
2024, Advances in Mathematics of Communications
- ∗
This research was supported by Grant No. 86-00301 from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. Current address: IBM T. J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598.
Copyright © 1992 Published by Elsevier Inc.