Seedless Fruit Is the Sweetest: Random Number Generation, Revisited

Sandro Coretti
Sandro Coretti
Harish Karthikeyan
Harish Karthikeyan

ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT 1, pp. 205-234, 2019.

Cited by: 4|Bibtex|Views20|Links
EI
Keywords:
Provable securityPseudorandom number generationSymmetric cryptography

Abstract:

The need for high-quality randomness in cryptography makes random-number generation one of its most fundamental tasks. A recent important line of work (initiated by Dodis et al., CCS '13) focuses on the notion of robustness for pseudorandom number generators (PRNGs) with inputs. These are primitives that use various sources to accumulate ...More

Code:

Data:

Your rating :
0

 

Tags
Comments