Provably Robust Sponge-Based PRNGs and KDFs

DOI10.1007/978-3-662-49890-3_4zbMath1347.94033OpenAlexW2468012243MaRDI QIDQ2820479

Peter Gaži, Stefano Tessaro

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_4

zbMATH Keywords

weak randomnessSHA-3key derivationspongespseudo-random number generators (PRNGs)

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (7)

No time to hash: on super-efficient entropy accumulation ⋮ Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions ⋮ A robust and sponge-like PRNG with improved efficiency ⋮ Performance of finite precision on discrete chaotic map based on a feedback shift register ⋮ Extracting randomness from extractor-dependent sources ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ Security analysis of NIST CTR-DRBG

This page was built for publication: Provably Robust Sponge-Based PRNGs and KDFs