Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results

Jean Paul Degabriele, Kenneth G. Paterson, Jacob C. N. Schuldt, and Joanne Woodage

Abstract

Inspired by the Dual EC DBRG incident, Dodis et al. (Eurocrypt 2015) initiated the formal study of backdoored PRGs, showing that backdoored PRGs are equivalent to public key encryption schemes, giving constructions for backdoored PRGs (BPRGs), and showing how BPRGs can be immunised'' by careful post-processing of their outputs. In this paper, we continue the foundational line of work initiated by Dodis et al., providing both positive and negative results. We first revisit the backdoored PRG setting of Dodis et al., showing that PRGs can be more strongly backdoored than was previously envisaged. Specifically, we give efficient constructions of BPRGs for which, given a single generator output, Big Brother can recover the initial state and, therefore, all outputs of the BPRG. Moreover, our constructions are forward-secure in the traditional sense for a PRG, resolving an open question of Dodis et al. in the negative. We then turn to the question of the effectiveness of backdoors in robust PRNGs with input (c.f. Dodis et al., ACM-CCS 2013): generators in which the state can be regularly refreshed using an entropy source, and in which, provided sufficient entropy has been made available since the last refresh, the outputs will appear pseudorandom. The presence of a refresh procedure might suggest that Big Brother could be defeated, since he would not be able to predict the values of the PRNG state backwards or forwards through the high-entropy refreshes. Unfortunately, we show that this intuition is not correct: we are also able to construct robust PRNGs with input that are backdoored in a backwards sense. Namely, given a single output, Big Brother is able to rewind through a number of refresh operations to earlier phases'', and recover all the generator's outputs in those earlier phases. Finally, and ending on a positive note, we give an impossibility result: we provide a bound on the number of previous phases that Big Brother can compromise as a function of the state-size of the generator: smaller states provide more limited backdooring opportunities for Big Brother.

Available format(s)
Category
Public-key cryptography
Publication info
A major revision of an IACR publication in CRYPTO 2016
Keywords
BackdoorSurveillancePRNG with inputPRGSubversionDual EC
Contact author(s)
jpdega @ gmail com
History
Short URL
https://ia.cr/2016/577

CC BY

BibTeX

@misc{cryptoeprint:2016/577,
author = {Jean Paul Degabriele and Kenneth G.  Paterson and Jacob C.  N.  Schuldt and Joanne Woodage},
title = {Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results},
howpublished = {Cryptology ePrint Archive, Paper 2016/577},
year = {2016},
note = {\url{https://eprint.iacr.org/2016/577}},
url = {https://eprint.iacr.org/2016/577}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.