Provably robust sponge-based PRNGs and KDFs
From MaRDI portal
Recommendations
Cited in
(15)- A robust and sponge-like PRNG with improved efficiency
- Extracting randomness from extractor-dependent sources
- Security analysis of NIST CTR-DRBG
- No time to hash: on super-efficient entropy accumulation
- Seedless fruit is the sweetest: random number generation, revisited
- Performance of finite precision on discrete chaotic map based on a feedback shift register
- Beyond conventional security in sponge-based authenticated encryption modes
- A provable-security analysis of Intel's secure key RNG
- Sponge-based pseudo-random number generators
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- On seedless PRNGs and premature next
- Enhancing provable security and efficiency of permutation-based DRBGs
- Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
- Provable security of Linux-DRBG in the seedless robustness model
- Generalized triangular dynamical system: an algebraic system for constructing cryptographic permutations over finite fields
This page was built for publication: Provably robust sponge-based PRNGs and KDFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820479)