A hardware random number generator

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

Volumn 2523, Issue , 2003, Pages 450-453

  Tkacik, Thomas E ^a  

^a MOTOROLA INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; EMBEDDED SYSTEMS; HARDWARE; NUMBER THEORY;

BATTERY OF TESTS; CRYPTOGRAPHIC RANDOM NUMBERS; DIFFERENT STRUCTURE; FREE-RUNNING OSCILLATORS; RANDOM NUMBER GENERATORS; TWO-STATE;

RANDOM NUMBER GENERATION;

EID: 21144441769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36400-5_32     Document Type: Article

References (7)

1. I. Goldberg and D. Wagner. Randomness and the Netscape Browser. Dr. Dobb's Journal, January 1996.
2. G. Marsaglia. DIEHARD Statistical Tests, http://stat.fsu.edu/~geo/ diehard.html
3. FIPS PUB 140. Security requirements for cryptographic modules. May 2001.
4. Crypt-X. http://www.isrc.qut.edu.au/resource/cryptx.
5. S. Wolfram. Random sequence generation by cellular automata. Advances in Applied Mathematics, 7:123-169, June 1986.
6. W. Pries, A. Thanailakis, and H. C. Card. Group properties of cellular automata and VLSI applications. IEEE Transactions on Computers, 35(12):1013-1024, December 1986.
7. P. D. Hortensius, R. D. McLeod, and H. C. Card. Parallel random number generation for VLSI systems using cellular automata. IEEE Transactions on Computers, 38(10):1466-1473, October 1989.