SoK: Security Models for Pseudo-Random Number Generators

  • Sylvain Ruhault Oppida, 6 avenue du Vieil Etang, 78180 Montigny Le Bretonneux, France
Keywords: Pseudo-random number generation, Security Models, Entropy

Abstract

Randomness plays an important role in multiple applications in cryptography. It is required in fundamental tasks such as key generation, masking and hiding values, nonces and initialization vectors generation. Pseudo-random number generators have been studied by numerous authors, either to propose clear security notions and associated constructions or to point out potential vulnerabilities. In this systematization of knowledge paper, we present the three notions of generators that have been successively formalized: standard generators, stateful generators and generators with input. For each notion, we present expected security properties, where adversaries have increasing capabilities (including access to partial information on the internal variables) and we propose secure and efficient constructions, all based on the block cipher AES. In our description of generators with input, we revisit the notions of accumulator and extractor and we point out that security crucially relies on the independence between the randomness source and the seeds of the accumulator and the extractor. To illustrate this requirement, we identify a potential vulnerability of the NIST standard CTR_DRBG.
Published
2017-03-08
How to Cite
Ruhault, S. (2017). SoK: Security Models for Pseudo-Random Number Generators. IACR Transactions on Symmetric Cryptology, 2017(1), 506-544. https://doi.org/10.13154/tosc.v2017.i1.506-544
Section
Articles