Seedless fruit is the sweetest: random number generation, revisited

DOI10.1007/978-3-030-26948-7_8zbMath1472.94048OpenAlexW2934734216MaRDI QIDQ2181851

Stefano Tessaro, Yevgeniy Dodis, Sandro Coretti, Harish Karthikeyan

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_8

zbMATH Keywords

pseudorandom number generationprovable securitysymmetric cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

No time to hash: on super-efficient entropy accumulation ⋮ Extracting randomness from extractor-dependent sources ⋮ Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation ⋮ Security analysis of NIST CTR-DRBG

This page was built for publication: Seedless fruit is the sweetest: random number generation, revisited