A practice-oriented treatment of pseudorandom number generators

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

Volumn 2332, Issue , 2002, Pages 368-383

  Desai, Anand ^a   Hevia, Alejandro ^b   Yin, Yiqun Lisa ^a  

^a NTT Multimedia Communications Laboratories   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; NUMBER THEORY;

NUMBER GENERATOR; PSEUDO RANDOM NUMBER GENERATORS;

RANDOM NUMBER GENERATION;

EID: 84947295950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_24     Document Type: Conference Paper

References (35)

1. M. Abdalla and M. Bellare, “Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques,” ASIACRYPT 2000.
2. W. Aiello, S. Rajagopalan, and R. Venkatsan, “High-Speed Pseudorandom Number Generation with Small Memory,” FSE 1999.
3. ANSI X9.17 (Revised), “American National Standard for Financial Institution KeyManagemen t (Wholesale),” America Bankers Association, 1985.
4. ANSI X9.31, “American National Standard for Financial Institution KeyManagement (Wholesale),” America Bankers Association, 2001.
5. R. Baldwin, “PreliminaryAnaly sis of the BSAFE 3.x Pseudorandom Number Generators,” RSA Laboratories’ Bulletin No. 8, 1998.
6. M. Bellare, R. Canetti and H. Krawczyk, “Keying Hash Functions for Message Authentication,” CRYPTO 1996.
7. M. Bellare, R Canetti and H Krawczyk, “Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security,” FOCS 1996.
8. M. Bellare, A. Desai, E. Jokipii and P. Rogaway, “A Concrete Security Treatment of Symmetric Encryption,” FOCS 1997.
9. M. Bellare, R. Guerin, and P. Rogaway, “XOR MACs: New Methods for Message Authentication using Finite Pseudorandom Functions,” CRYPTO 1995.
10. M. Bellare, J. Kilian and P. Rogaway, “The Securityof the Cipher Block Chaining Message Authentication Code,” CRYPTO 1994.
11. M. Bellare, T. Krovetz, and P. Rogaway, “Luby-Rackoff Backwards: Increasing Securityb ymaking Block Ciphers Non-Invertible,” EUROCRYPT 1998.
12. M. Bellare and B. Yee, “Forward Securityin Private-KeyCry ptography,” Cryptology ePrint Archive, Report 2001/035.
13. D. Bleichenbacher, Lucent Technologies Press Release, http://www.lucent.com/press/0201/010205.bla.html.
14. L. Blum, M. Blum, and M. Shub, “A Simple Unpredictable Pseudorandom Number Generator.” SIAM J. Computing, 15(2), 1986.
15. M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudorandom Bits.” SIAM J. Computing, 13, 1984.
16. R. Canetti, O. Goldreich, and S. Halevi, “The Random Oracle Model, Revisited.” STOC 1998.
17. W. Dai, Crypto++ Library. http://www.eskimo.com/∼weidai/cryptlib.html
18. B. Den Boer and A. Bosselaers, “Collisions for the Compression Function of MD5,” CRYPTO 1993.
19. A. Desai, A. Hevia and Y.L. Yin, “A Practice-Oriented Treatment of Pseudorandom Number Generators,” http://www.cs.ucsd.edu/users/adesai.
20. T. Dierks, and C. Allen, “The TLS Protocol Version 1.0,” RFC 2246, Internet Request for Comments, 1999.
21. H. Dobbertin, “The Status of MD5 After a Recent Attack,” RSA Labs’ CryptoBytes, Vol.2 No.2, 1996.
22. FIPS PUB 186-2, “Digital Signature Standard,” National Institute of Standards and Technologies, 1994.
23. FIPS PUB 186-2 (Change Notice 1), “Digital Signature Standard,” National Institute of Standards and Technologies, 2001.
24. A. Frier, P. Karlton, and P. Kocher, “The SSL 3.0 Protocol,” Netscape Communications Corp., Nov 18, 1996.
25. O. Goldreich, S. Goldwasser, and S. Micali, “How to Construct Random Functions,” Journal of the ACM, Vol. 33, N0. 4, 1986.
26. P. Gutmann, “Software Generation of PracticallyStrong Random Numbers,” USENIX SecuritySy mposium 1998.
27. J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby, “Pseudorandom Generation from One-WayF unctions,” STOC 1989.
28. J. Kelsey, B. Schneier, and N. Ferguson, “Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator,” SAC 1999.
29. J. Kelsey, B. Schneier, D. Wagner, and C. Hall, “Cryptanalytic Attacks on Pseudorandom Number Generators,” FSE 1998.
30. J.B. Lacy, D.P. Mitchell, and V.M. Schell, “Cryptolib: Cryptography in Software,” USENIX SecuritySy mposium, 1993.
31. Network Associates, Inc., “PGPsdk 2.1.1 Source Code for Peer Review”.
32. P. Van Oorschot and M. Wiener “Parallel Collision Search with Applications to Hash Functions and Discrete Logarithms,” ACM CCS 1994.
33. RSA Laboratories, “RSAREF Cryptographic Library,” 1994.
34. A.C. Yao, “Theoryand Applications of Trapdoor Functions,” FOCS 1982.
35. E.A. Young and T.J. Hudson, “OpenSSL Libraryv.0.9.6c,” 2001.