The entropy source of pseudo random number generators: from low entropy to high entropy
Authors:
- 1 July 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 161-163
Abstract
The pseudo random number generators (PRNG) is one type of deterministic functions. The information entropy of the output sequences depends on the entropy of the input seeds. The output sequences can be predicted if attackers could know or control the input seeds of PRNGs. Against that, it is necessary that the input seeds is unpredictable, that is to say, the information entropy of the seeds is high enough. However, if there is no high enough entropy sources in environment, how to generate the seeds of PRNG? In other words, how to increase the entropy of the input seeds? Many approaches for extracting entropy from physical environment have been proposed, which lack of theoretical analysis. The condition of entropy’s increasing is given. A model is built to verify the condition based on the functional programming language F*. An example of entropy’s increasing is proposed utilizing execution time randomness of arbitrary codes. Then an algorithm is described, which can generate the seed when the entropy value is given.Keywords
This publication has 10 references indexed in Scilit:
- Recoverable Random Numbers in an Internet of Things Operating SystemEntropy, 2017
- Practical Detection of Entropy Loss in Pseudo-Random Number Generators2016
- An Analysis of OpenSSL’s Random Number Generator2016
- CBMC – C Bounded Model Checker2014
- Welcome to the Entropics: Boot-Time Entropy in Embedded Devices2013
- Recommendation for random number generation using deterministic random bit generators2012
- Secure distributed programming with value-dependent types2011
- A model and architecture for pseudo-random generation with applications to /dev/random2005
- Practical random number generation in software2004
- Seeds for random number generatorsCommunications of the ACM, 2003