Security analysis of NIST CTR-DRBG
From MaRDI portal
Publication:2096485
DOI10.1007/978-3-030-56784-2_8zbMath1501.94059OpenAlexW3037004127MaRDI QIDQ2096485
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_8
Related Items (1)
Cites Work
- Security analysis of NIST CTR-DRBG
- Seedless fruit is the sweetest: random number generation, revisited
- An analysis of NIST SP 800-90A
- On recycling the randomness of states in space bounded computation
- Provably Robust Sponge-Based PRNGs and KDFs
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- A Provable-Security Analysis of Intel’s Secure Key RNG
- Salvaging Weak Security Bounds for Blockcipher-Based Constructions
- Sponge-Based Pseudo-Random Number Generators
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- The “Coefficients H” Technique
- A Pseudorandom Generator from any One-way Function
- Leftover Hash Lemma, Revisited
- Advances in Cryptology – CRYPTO 2004
- Tight Security Bounds for Key-Alternating Ciphers
- Advances on Access-Driven Cache Attacks on AES
- Improved Security Analyses for CBC MACs
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Security analysis of NIST CTR-DRBG
