On Stern's attack against secret truncated linear congruential generators

Lecture Notes in Computer Science

Volumn 3574, Issue , 2005, Pages 52-60

  Contini, Scott ^a   Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; HEURISTIC METHODS; POLYNOMIALS; ROBUSTNESS (CONTROL SYSTEMS);

CONGRUENTIAL GENERATORS; POLYNOMIAL TIME;

LINEAR SYSTEMS;

EID: 26444449872     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11506157_5     Document Type: Conference Paper

References (16)

1. M. Ajtai, R. Kumar and D. Sivakumar, 'A sieve algorithm for the shortest lattice vector problem', Proc. 33rd ACM Symp. on Theory of Comput., ACM, 2001, 601-610.
2. J. Boyar, 'Inferring sequences produced by pseudo-random number generators', J. ACM, 36 (1989), 129-141.
3. J. Boyar, 'Inferring sequences produces by a linear congruential generator missing low-order bits', J. Cryptology 1 (1989) 177-184.
4. A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and A. Shamir. 'Reconstructing truncated integer variables satisfying linear congruences', SIAM J. Comp., 17 (1988), 262-280.
5. A. Joux and J. Stern, 'Lattice reduction: A toolbox for the cryptanalyst', J. Cryptology, 11 (1998), 161-185.
6. S. V. Konyagin and I. Shparlinski, Character sums with exponential functions and their applications, Cambridge Univ. Press, Cambridge, 1999.
7. D. E. Knuth, 'Deciphering a linear congruential encryption', IEEE Trans. Inf. Theory 31 (1985), 49-52.
8. D. E. Knuth, The art of computer Programming: Seminumerical algorithms, Vol.2. Addison-Wesley, 1981.
9. H. Krawczyk, 'How to predict congruential generators', J. Algorithms, 13 (1992), 527-545.
10. P. Kurlberg and C. Pomerance, 'On the period of the linear congruential and power generators', Acta Arith., (to appear).
11. A. K. Lenstra, H. W. Lenstra and L. Lovász, 'Factoring polynomials with rational coefficients', Mathematische Ann., 261 (1982), 513-534.
12. Magma Computer Algebra Package, http://magma.maths.usyd.edu.au/magma/.
13. H. Niederreiter, 'Quasi-Monte Carlo methods and pseudo-random numbers', Bull. Amer. Math. Soc., 84 (1978), 957-1041.
14. H. Niederreiter, Random number generation and Quasi-Monte Carlo methods, SIAM Press, 1992.
15. C. P. Schnorr, 'A hierarchy of polynomial time basis reduction algorithms', Theor. Comp. Sci., 53 (1987), 201-224.
16. J. Stern, 'Secret linear congruential generators are not cryptographically secure', Proc. 28th IEEE Symp. on Found, of Comp. Sci., IEEE, 1987, 421-426.