Practical State Recovery Attacks against Legacy RNG Implementations
暂无分享,去创建一个
[1] Arjen K. Lenstra,et al. Ron was wrong, Whit is right , 2012, IACR Cryptol. ePrint Arch..
[2] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[3] Elaine B. Barker,et al. SP 800-131A. Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths , 2011 .
[4] Elaine B. Barker,et al. Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths , 2011 .
[5] Hovav Shacham,et al. When private keys are public: results from the 2008 Debian OpenSSL vulnerability , 2009, IMC '09.
[6] Nadia Heninger,et al. Weak Keys Remain Widespread in Network Devices , 2016, Internet Measurement Conference.
[7] Benny Pinkas,et al. Analysis of the Linux random number generator , 2006, 2006 IEEE Symposium on Security and Privacy (S&P'06).
[8] W. Douglas Maughan,et al. Internet Security Association and Key Management Protocol (ISAKMP) , 1998, RFC.
[9] Falko Strenzke. An Analysis of OpenSSL's Random Number Generator , 2016, EUROCRYPT.
[10] Bruce Schneier,et al. Yarrow-160: Notes on the Design and Analysis of the Yarrow Cryptographic Pseudorandom Number Generator , 1999, Selected Areas in Cryptography.
[11] David Pointcheval,et al. Security analysis of pseudo-random number generators with input: /dev/random is not robust , 2013, CCS.
[12] Charlie Kaufman,et al. Internet Key Exchange (IKEv2) Protocol , 2005, RFC.
[13] Eric Wustrow,et al. Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices , 2012, USENIX Security Symposium.
[14] Hovav Shacham,et al. A Systematic Analysis of the Juniper Dual EC Incident , 2016, IACR Cryptol. ePrint Arch..
[15] Dan Harkins,et al. The Internet Key Exchange (IKE) , 1998, RFC.
[16] Miles E. Smid,et al. Security Requirements for Cryptographic Modules | NIST , 1994 .
[17] Dan Shumow,et al. An Analysis of the NIST SP 800-90A Standard , 2018, IACR Cryptol. ePrint Arch..
[18] John Kelsey,et al. Recommendation for Random Number Generation Using Deterministic Random Bit Generators , 2014 .
[19] Yevgeniy Dodis,et al. A Formal Treatment of Backdoored Pseudorandom Generators , 2015, EUROCRYPT.
[20] Benny Pinkas,et al. Cryptanalysis of the random number generator of the Windows operating system , 2009, TSEC.
[21] Lawrence C. Stewart,et al. HTTP Authentication: Basic and Digest Access Authentication , 1999 .
[22] Stephan Müller. Linux Random Number Generator , 2017 .
[23] Bruce Schneier,et al. Cryptanalytic Attacks on Pseudorandom Number Generators , 1998, FSE.
[24] Kenneth G. Paterson,et al. Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results , 2016, CRYPTO.
[25] Moti Yung,et al. The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems , 1997, CRYPTO.
[26] Sylvain Ruhault,et al. SoK: Security Models for Pseudo-Random Number Generators , 2017, IACR Trans. Symmetric Cryptol..
[27] Fabrice Boudot,et al. On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation , 2017, IACR Cryptol. ePrint Arch..
[28] Igor E. Shparlinski,et al. The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces , 2003, Des. Codes Cryptogr..
[29] Arjen K. Lenstra,et al. Public Keys , 2012, CRYPTO.
[30] Thomas Ristenpart,et al. When Good Randomness Goes Bad: Virtual Machine Reset Vulnerabilities and Hedging Deployed Cryptography , 2010, NDSS.
[31] William Herlands,et al. Effective Entropy: Security-Centric Metric for Memory Randomization Techniques , 2014, CSET.
[32] Philipp Winter,et al. "Major Key Alert!" Anomalous Keys in Tor Relays , 2018, Financial Cryptography.
[33] Daniel R. L. Brown. Conjectured Security of the ANSI-NIST Elliptic Curve RNG , 2006, IACR Cryptol. ePrint Arch..
[34] Dan Shumow,et al. An Analysis of NIST SP 800-90A , 2019, EUROCRYPT.
[35] Tanja Lange,et al. Factoring RSA keys from certified smart cards: Coppersmith in the wild , 2013, IACR Cryptol. ePrint Arch..
[36] Moti Yung,et al. Kleptography: Using Cryptography Against Cryptography , 1997, EUROCRYPT.
[37] Jörg Schwenk,et al. Randomly Failed! The State of Randomness in Current Java Implementations , 2013, CT-RSA.
[38] Kenneth G. Paterson,et al. Security of Symmetric Encryption against Mass Surveillance , 2014, IACR Cryptol. ePrint Arch..
[39] Adi Shamir,et al. How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs , 2017, Algorithmica.
[40] Matthew Green,et al. Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice , 2015, CCS.
[41] Elaine B. Barker,et al. Recommendation for Random Number Generation Using Deterministic Random Bit Generators , 2007 .
[42] Tanja Lange,et al. On the Practical Exploitability of Dual EC in TLS Implementations , 2014, USENIX Security Symposium.