Practical Random Number Generation In Software
ACSAC '03: Proceedings of the 19th Annual Computer Security Applications Conference(2003)
摘要
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 accumulating entropy, we show how to deal with forking processes without using a two-phase commit, we explore better metrics for estimating entropy and argue that systems should provide both computational security and information theoretic security through separate interfaces.
更多查看译文
关键词
cryptography,entropy,random number generation,256-bit AES key,computational security,entropy estimation,information theoretic security,operating system,random number generation,software-based infrastructure,two-phase commit,universal hash function,
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要