"pseudo-random" number generation within cryptographic algorithms: The DDS case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1294, Issue , 1997, Pages 277-291

  Bellare, Mihir ^a   Goldwasser, Shafi ^b   Micciancio, Daniele ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; NUMBER THEORY;

CRYPTOGRAPHIC ALGORITHMS; CRYPTOGRAPHIC APPLICATIONS; LINEAR CONGRUENTIAL GENERATOR; PSEUDO RANDOM; PSEUDO RANDOM NUMBER GENERATORS; PSEUDORANDOM GENERATORS; RANDOM NUMBERS; SIGNATURE ALGORITHMS;

RANDOM NUMBER GENERATION;

EID: 84958656559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052242     Document Type: Conference Paper

References (20)

1. L. Babai. On Lovász' lattice reduction and the nearest lattice point problem. Combinatorial, 6(1):1-13, 1986.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Computing, 13(4):850-863, November 1984.
4. Joan Boyax. Inferring sequences produced by pseudo-random number generators. Journal of the ACM, 36(1):129-141, January 1989.
5. A. M. Frieze, R. Kannan, and J. C. Lagarias. Linear congruential generators do not produce random sequences. In Proc. 25th IEEE Symp. on Foundations of Comp. Science, pages 480-484, Singer Island, 1984. IEEE.
6. Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. C. Chaum, editors, Proc. CRYPTO 84, pages 10-18. Sringer, 1985. Lecture Notes in Computer Science No. 196.
7. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. In Proc. 25th IEEE Symp. on Foundations of Comp. Science, pages 464-479, Singer Island, 1984. IEEE.
8. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences 28:270-299, April 1984.
9. J. Hastad and A. Shamir. The cryptographic security of truncated linearly related variables. In Proc. 17th ACM Symp. on Theory of Computing, pages 356-362, Providence, 1985. ACM.
10. R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of operations research, 12(3):415-440, 1987.
11. Donald E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 1969. Second edition, 1981.
12. Donald E. Knuth. Deciphering a linear congruential encryption. IEEE Transactions on Information Theory, IT-31(1):49-52, January 1985.
13. H. Krawczyk. How to predict congruential generators. In G. Brassard, editor, Proc. CRYPTO 89, pages 138-153. Springer, 1990. Lecture Notes in Computer Science No. 435.
14. H.W. Lenstra. Integer programming with a fixed number of variables. Mathematics of operations research, 8(4):538-548, 1983.
15. National Institute of Standards and Technology (NIST). FIPS Publication 180: Secure Hash Standard (SHS), May 11, 1993.
16. National Institute of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard, May 19, 1994.
17. J. Plumstead (Boyar). Inferring a sequence generated by a linear congruence. In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 153-159, Chicago, 1982. IEEE.
18. Adi Shamir. The generation of cryptographically strong pseudo-random sequences. In Allen Gersho, editor, Advances in Cryptology: A Report on CRYPTO 81, pages 1-1. U.C. Santa Barbara Dept. of Elec. and Computer Eng., 1982. Tech Report 82-04.
19. J. Stern. Secret linear congruential generators are not cryptographically secure. In Proc. 28th IEEE Symp. on Foundations of Comp. Science, pages 421-426, Los Angeles, 1987. IEEE.
20. A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 80-91, Chicago, 1982. IEEE.