In this paper we improve the security analysis of this TRNG. Essentially, we significantly reduce the entropy loss and running time needed to obtain a required level of security and robustness.
Our approach is based on replacing the combination of union bounds and tail inequalities for $\ell$-wise independent random variables in the original proof, by a more refined of the deviation of the probability that a randomly chosen item is hashed into a particular location.
Category / Keywords: foundations / True Random Number Generators, Resilient Extractors, Hash Functions Date: received 14 Oct 2014 Contact author: maciej skorski at gmail com Available format(s): PDF | BibTeX Citation Version: 20141020:134419 (All versions of this report) Short URL: ia.cr/2014/837 Discussion forum: Show discussion | Start new discussion