A model and architecture for pseudo-random generation and applications to /dev/random

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2005, Pages 203-212

  Barak, Boaz ^a   Halevi, Shai ^b  

^a Princeton University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Dev random; Entropy; Mixing functions; Pseudorandomness; Smart cards; True randomness

Indexed keywords

DEV/RANDOM; MIXING FUNCTIONS; PSEUDORANDOMNESS; TRUE RANDOMNESS;

COMPUTER ARCHITECTURE; KNOWLEDGE ENGINEERING; MATHEMATICAL MODELS; OBSERVABILITY; ROBUSTNESS (CONTROL SYSTEMS); SECURITY SYSTEMS; SMART CARDS;

RANDOM NUMBER GENERATION;

EID: 33745781447     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102120.1102148     Document Type: Conference Paper

References (14)

1. B. Barak, R. Shaltiel, and E. Tromer. True random number generators secure in a changing environment. In Workshop on Cryptographic Hardware and Embedded Systems (CHES), pages 166-180, 2003. LNCS no. 2779.
2. M. Bellare and B. Yee. Forward-security in private-key cryptography. In Topics in Cryptology - CT-RSA '03, pages 1-18, 2003.
3. M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput., 13(4):850-864, Nov. 1984. Preliminary version in FOCS '82.
4. R. Canetti and A. Herzberg. Maintaining security in the presence of transient faults. In Crypto '94, pages 425-438, 1994. LNCS No. 839.
5. Y. Dodis, R. Gennaro, J. Håstad, H. Krawczyk, and T. Rabin. Randomness extraction and key derivation using the CBC, Cascade and HMAC modes. In Crypto '04, pages 494-510, 2004. LNCS No. 3152
6. Y. Dodis and A. Smith. Entropic security and the encryption of high entropy messages. In Theory of Cryptography Conference (TCC) '05, pages 556-577, 2005.
7. N. Ferguson and B. Schneier. Practical Cryptography. Wiley, New York, NY, USA, 2003.
8. I. Goldberg and D. Wagner. Randomness and the Netscape browser. Dr. Dobb's Journal, pages 66-70, 1996.
9. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proc. 21st STOC, pages 25-32. ACM, 1989.
10. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. In Proc. 19th STOC, pages 218-229. ACM, 25-27 May 1987.
11. P. Gutmann. Software generation of practically strong random numbers. In Proceedings of the 7th USENIX Security Symposium, 1998. Available from http://www.cs.auckland.ac.nz/~pgut001/.
12. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999. Preliminary versions appeared in STOC' 89 and STOC' 90.
13. J. Kelsey, B. Schneier, D. Wagner, and C. Hall. Cryptanalytic attacks on pseudorandom number generators. In FSE '98, pages 168-188, 1998. LNCS No. 1372.
14. R. Shaltiel. Recent developments in extractors. In G. Paun, R. I. Virgili, G. Rozenberg, and A. Salomaa, editors, Current trends in theoretical computer science., volume 1. World Scientific, 2004. Preliminary version in bulletin of the EATCS, 2002. Available on http://www.cs.haifa.ac.il/~ronen/.