Practical Random Number Generation in Software

  title={Practical Random Number Generation in Software},
  author={John Viega},
There is a large gap between the theory and practice for random number generation. For example, on most operating systems, using /dev/random to generate a 256-bit AES key is highly likely to produce a key with no more than 160 bits of security. In this paper, we propose solutions to many of the issues that real software-based random number infrastructures have encountered. Particularly, we demonstrate that universal hash functions are a theoretically appealing and efficient mechanism for… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 23 extracted citations

Usage of asymmetric encryption algorithms to enhance the security of sensitive data in secure communication

2012 IEEE 10th International Symposium on Applied Machine Intelligence and Informatics (SAMI) • 2012
View 4 Excerpts
Highly Influenced

An Analysis of OpenSSL's Random Number Generator

IACR Cryptology ePrint Archive • 2016
View 1 Excerpt

A novel chaotic generator based on weakly-coupled discrete skewtent maps

2015 10th International Conference for Internet Technology and Secured Transactions (ICITST) • 2015
View 1 Excerpt

56 Citations

Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-8 of 8 references

How we learned to cheat in online poker

B. Arkin, F. Hill
View 1 Excerpt

The design and verification of a cryptographic security architecture , ” Ph . D . dissertation

B. Schneier J. Kelsey, N. Ferguson
Dr . Dobbs ’ Journal , Jan . • 1996

How we learned to cheat in online poker ” , developer

A. Desai M. Bellare, E. Jokipii, P. Rogaway