Enhancing provable security and efficiency of permutation-based DRBGs

DOI10.1007/978-3-032-01901-1_15MaRDI QIDQ6862741zbMATH OpenFDO

Authors Woohyuk Chung, Seongha Hwang, Hwigyeom Kim, Jooyoung Lee

Publication date 6 February 2026

zbMATH Keywords

permutationprovable securitycryptographic spongedeterministic random bit generatorseedless robustness model

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Cites work

• A provable-security analysis of Intel's secure key RNG
• A robust and sponge-like PRNG with improved efficiency
• An analysis of NIST SP 800-90A
• Enhancing provable security and efficiency of permutation-based DRBGs
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• Practical cryptography
• Provable security of Linux-DRBG in the seedless robustness model
• Provably robust sponge-based PRNGs and KDFs
• Security analysis of NIST CTR-DRBG
• Seedless fruit is the sweetest: random number generation, revisited
• Sponge-based pseudo-random number generators
• \textsc{KangarooTwelve}: fast hashing based on \({\mathrm {KECCAK}\mathrm{-}p}{}\)

Cited in

(1)

• Enhancing provable security and efficiency of permutation-based DRBGs

This page was built for publication: Enhancing provable security and efficiency of permutation-based DRBGs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862741)