High-Speed Pseudorandom Number Generation with Small Memory
- 1 January 1999
- book chapter
- Published by Springer Nature
- p. 290-304
- https://doi.org/10.1007/3-540-48519-8_21
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Chernoff bound for random walks on expander graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Pseudorandom functions revisited: the cascade construction and its concrete securityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Design of Practical and Provably Good Random Number GeneratorsJournal of Algorithms, 1998
- Fast software encryption: Designing encryption algorithms for optimal software speed on the Intel Pentium processorPublished by Springer Nature ,1997
- Keying Hash Functions for Message AuthenticationPublished by Springer Nature ,1996
- Parallel collision search with application to hash functions and discrete logarithmsPublished by Association for Computing Machinery (ACM) ,1994
- Collisions for the compression function of MD5Published by Springer Nature ,1994
- Eigenvalues and expandersCombinatorica, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Theory and application of trapdoor functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982