An analysis of OpenSSL's random number generator

DOI10.1007/978-3-662-49890-3_25zbMATH Open1385.94074OpenAlexW2461407378MaRDI QIDQ2820501FDOQ2820501

Authors: Falko Strenzke 

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_25

Recommendations

• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• How to eat your entropy and have it too -- optimal recovery strategies for compromised RNGs
• Cryptanalytic attacks on pseudorandom number generators
• Seedless fruit is the sweetest: random number generation, revisited
• A provable-security analysis of Intel's secure key RNG

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60)

Cited In (3)

• An intermediate secret-guessing attack on hash-based signatures
• How to eat your entropy and have it too: optimal recovery strategies for compromised RNGs
• How to eat your entropy and have it too -- optimal recovery strategies for compromised RNGs

This page was built for publication: An analysis of OpenSSL's random number generator

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