How to predict congruential generators
- 31 December 1992
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 13 (4) , 527-545
- https://doi.org/10.1016/0196-6774(92)90054-g
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the power of two-point based samplingJournal of Complexity, 1989
- Inferring sequences produced by pseudo-random number generatorsJournal of the ACM, 1989
- Reconstructing Truncated Integer Variables Satisfying Linear CongruencesSIAM Journal on Computing, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- Deciphering a linear congruential encryptionIEEE Transactions on Information Theory, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Systems Of Linear CongruencesCanadian Journal of Mathematics, 1955