Security analysis of NIST CTR-DRBG
From MaRDI portal
Publication:2096485
DOI10.1007/978-3-030-56784-2_8zbMATH Open1501.94059OpenAlexW3037004127MaRDI QIDQ2096485FDOQ2096485
Authors: Viet Tung Hoang, Yaobin Shen 
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_8
Recommendations
Cites Work
- A Pseudorandom Generator from any One-way Function
- Tight security bounds for key-alternating ciphers
- Advances in Cryptology – CRYPTO 2004
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- The “Coefficients H” Technique
- Improved Security Analyses for CBC MACs
- On recycling the randomness of states in space bounded computation
- Topics in Cryptology – CT-RSA 2006
- Sponge-based pseudo-random number generators
- Leftover Hash Lemma, Revisited
- Key-alternating ciphers and key-length extension: exact bounds and multi-user security
- Provably robust sponge-based PRNGs and KDFs
- A provable-security analysis of Intel's secure key RNG
- Advances on Access-Driven Cache Attacks on AES
- Seedless fruit is the sweetest: random number generation, revisited
- Security analysis of NIST CTR-DRBG
- An analysis of NIST SP 800-90A
- Salvaging weak security bounds for blockcipher-based constructions
Cited In (9)
- An analysis of NIST SP 800-90A
- A forkcipher-based pseudo-random number generator
- Title not available (Why is that?)
- Security analysis of the ISO standard \textsf{OFB}-\textsf{DRBG}
- Reinterpreting and improving the cryptanalysis of the Flash Player PRNG
- A robust and sponge-like PRNG with improved efficiency
- A provable-security analysis of Intel's secure key RNG
- Provably robust sponge-based PRNGs and KDFs
- Security analysis of NIST CTR-DRBG
This page was built for publication: Security analysis of NIST CTR-DRBG
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096485)
