High-speed pseudorandom number generation with small memory

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

Volumn 1636, Issue , 1999, Pages 290-304

  Aiello, William ^a   Rajagopalan, S ^b   Venkatesan, Ramarathnam ^c  

^a AT AND T LABS RESEARCH   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; RANDOM NUMBER GENERATION; SMART CARDS;

HIGH SPEED; MEMORY REQUIREMENTS; PENTIUM; PSEUDO-RANDOM FUNCTIONS; PSEUDO-RANDOM NUMBERS; PSEUDORANDOM GENERATORS; SECURE HASH FUNCTION; SECURITY REQUIREMENTS;

CRYPTOGRAPHY;

EID: 33745865955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48519-8_21     Document Type: Conference Paper

References (22)

1. W. Aiello, S. Rajagopalan, R. Venkatesan. “Design of Practical and Provably Good Random Number Generators,” J. Algorithms 29, (1998) 358-389. Appeared previously in 5th Annual ACM-SIAM Symp. Disc. Alg. (1995) 1-8.
2. N. Alon, “Eigenvalues and expanders,” Combinatorica 6 (1986) 83-96.
3. M. Bellare, R. Canetti, H. Krawczyk, “Keying Hash Functions for Message Authentication,” Proceedings of Crypto '96, 1-15.
4. M. Bellare, R. Canetti, H. Krawczyk, “Pseudorandom functions revisited: The Cascade Construction and its Concrete Security,” Proceedings of the 37th Symposium on Foundations of Computer Science, 1996.
5. M. Blum, S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudorandom Bits,” Proceedings of FOCS (1982); SIAM J. Computing, 13 (1984) 850-864.
6. B. den Boer, A. Bosselaers, “Collisions for the compression function of MD5,” Proceedings of Eurocrypt '93, 293-304, 1994.
7. H. Dobbertin, “The Status of MD5 After a Recent Attack,” CryptoBytes v2 No.2 (Summer 1996).
8. J.-B. Fischer, J. Stern, “An efficient pseudorandom generator provably as secure as syndrome decoding,” in Proceedings of EUROCRYPT96 (1996) 245-255.
9. O. Gabber, Z. Galil, “Explicit constructions of linear-sized superconcentrators,” J. Comput. Sys. Sci. 22 (1981).
10. D. Gillman, “A Chernoff bound for random walks in expander graphs,” Proceedings of FOCS (1993).
11. O. Goldreich, S. Goldwasser, and S. Micali, “On the cryptographic applications of random functions,” in Proceedings of CRYPTO 84 (1984) 276-288.
12. O. Goldreich, L.A. Levin, “Hard Core Bit For Any One Way Function,” Proceedings of STOC (1990); J. Symbolic Logic 58 (1993) 1102-1103.
13. J. Hastad, R. Impagliazzo, L.A. Levin, M. Luby, “Pseudorandom Generation From One-Way Functions, Proceedings of STOC (1989) 12-24; “Pseudorandom Generators under Uniform assumptions,” Proceedings of STOC (1990) 395-404.
14. M. Luby, “Pseudorandomness and its Cryptographic applications” Princeton Univ Press, 1996.
15. M. Naor, O. Reingold, “Synthesizers and their application to the parallel construction of Pseudorandom Functions,” Proceedings of FOCS, (1995) 170-181.
16. M. Naor, O. Reingold, “Number-Theoretic Constructions of Efficient Pseudorandom Functions,” Proceedings of FOCS, (1997) 458-467.
17. M. Naor, O. Reingold, “From Unpredictability to Indistinguishability: A simple construction of Pseudorandom Functions from MACs,” Proceedings of Crypto'98, 267-282.
18. P. van Oorschot, M. Wiener, “Parallel collision search with application to hash functions and discrete logarithms,” in Proceedings of 2nd ACM Conference on Computer and Communication Security, 1994.
19. J. Patarin, “New Results on Pseudorandom Permutation Generators Based on the DES Scheme,” Proceedings of Crypto’91, (1991) 301-312.
20. M. J. B. Robshaw, “On Recent Results for MD2, MD4 and MD5,” RSA Laboratories Bulletin No. 4 (November 12, 1996).
21. B. Schneier, D. Whiting, “Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor,” Fast Software Encryption Workshop (1997) 242-259.
22. A.C. Yao, “Theory and Applications of Trapdoor Functions,” Proceedings of FOCS (1982) 80-91.