ISAAC

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

Volumn 1039, Issue , 1996, Pages 41-49

  Jenkins, Robert J ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; RANDOM NUMBER GENERATION;

CYCLE LENGTH; INTERNAL STATE; PSEUDO RANDOM NUMBER GENERATORS; SCALED-DOWN VERSIONS;

CRYPTOGRAPHY;

EID: 84958958085     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60865-6_41     Document Type: Conference Paper

References (12)

1. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput, 13:850-864, 1984.
2. W. G. Chambers, private communication, udee205@bay.cc.kcl.ac.uk.
3. D. Knuth. Seminumerical Methods, volume 2, chapter 3. Addison Wesley, 1981.
4. D. Knuth. Seminumerical Methods, volume 3, chapter 5. Addison Wesley, 1981.
5. V. F. Kolchin. Random mappings. Optimization Software Inc., 1986.
6. S. Lloyd. Counting binary functions with certain cryptographic properties. Journal of Cryptology, 5:107-131, 1992.
7. G. Marsaglia. A new class of random number generators. The Annals of Applied Probability, 1:462-480, 1991.
8. G. Marsaglia. Diehard, ftp stat.fsu.edu/pub/diehard/diehard.zip, 1995.
9. A. M. Odlyzko P. Flajolet. Random mapping statistics. Lecture Notes in Computer Science, 434:329-354, 1990.
10. W. Poundstone. Labyrinths of Reason. Anchor Press, 1988.
11. An0nYm0Us UsEr. Rc4 ? sci.crypt, 1994.
12. A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.