A robust and sponge-like PRNG with improved efficiency

DOI10.1007/978-3-319-69453-5_21zbMath1418.94051OpenAlexW2767381652MaRDI QIDQ1698655

Daniel Hutchinson

Publication date: 16 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-69453-5_21

zbMATH Keywords

robustnessspongepseudo-random number generator (PRNG)SHA-3ideal permutation modelkeccakPatarin's H-coefficient technique

Mathematics Subject Classification ID

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

Related Items (2)

No time to hash: on super-efficient entropy accumulation ⋮ Extracting randomness from extractor-dependent sources

Cites Work

• Unnamed Item
• Provably Robust Sponge-Based PRNGs and KDFs
• How to Eat Your Entropy and Have It Too – Optimal Recovery Strategies for Compromised RNGs
• A Provable-Security Analysis of Intel’s Secure Key RNG
• Sponge-Based Pseudo-Random Number Generators
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The “Coefficients H” Technique
• Keccak
• Tight Security Bounds for Key-Alternating Ciphers
• On the Indifferentiability of the Sponge Construction

This page was built for publication: A robust and sponge-like PRNG with improved efficiency