Security analysis of NIST CTR-DRBG
type: Item
instance of: scholarly article
title: Security analysis of NIST CTR-DRBG
zbMATH Open document ID: 1501.94059
DOI: 10.1007/978-3-030-56784-2_8
author: Viet Tung Hoang
author: Yaobin Shen
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614540
zbMATH Keywords: provable security
zbMATH Keywords: random number generator
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 8
OpenAlex ID: W3037004127
cites work: Leftover Hash Lemma, Revisited
cites work: Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
cites work: Improved Security Analyses for CBC MACs
cites work: Sponge-Based Pseudo-Random Number Generators
cites work: Tight Security Bounds for Key-Alternating Ciphers
cites work: Seedless fruit is the sweetest: random number generation, revisited
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Provably Robust Sponge-Based PRNGs and KDFs
cites work: A Pseudorandom Generator from any One-way Function
cites work: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
cites work: Advances on Access-Driven Cache Attacks on AES
cites work: Topics in Cryptology – CT-RSA 2006
cites work: The “Coefficients H” Technique
cites work: On recycling the randomness of states in space bounded computation
cites work: A Provable-Security Analysis of Intel’s Secure Key RNG
cites work: Salvaging Weak Security Bounds for Blockcipher-Based Constructions
cites work: An analysis of NIST SP 800-90A
description: scientific article; zbMATH DE number 7614540