A Provable-Security Analysis of Intel’s Secure Key RNG
作者： Thomas Shrimpton , R. Seth Terashima
DOI: 10.1007/978-3-662-46800-5_4
关键词:
摘要: We provide the first provable-security analysis of Intel Secure Key hardware RNG (ISK-RNG), versions which have appeared in processors since late 2011. To model ISK-RNG, we generalize PRNG-with-inputs primitive, introduced by Dodis et al. at CCS’13 for their /dev/[u]random analysis. The concrete security bounds uncover tell a mixed story. find that ISK-RNG lacks backward-security altogether, and forward-security bound “truly random” bits fetched \(\mathtt {RDSEED}\) instruction is potentially worrisome. On other hand, are able to prove stronger pseudorandom {RDRAND}\) instruction. En route these results, our main technical efforts focus on way employs CBCMAC as an entropy extractor.
springer.com
sci-hub.st 参考文章(11)
Mihir Bellare, Phillip Rogaway, The security of triple encryption and a framework for code-based game-playing proofs Lecture Notes in Computer Science. pp. 409- 426 ,(2006)
Yevgeniy Dodis, Rosario Gennaro, Johan Håstad, Hugo Krawczyk, Tal Rabin, Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes Advances in Cryptology – CRYPTO 2004. pp. 494- 510 ,(2004) , 10.1007/978-3-540-28628-8_30
Yevgeniy Dodis, David Pointcheval, Sylvain Ruhault, Damien Vergniaud, Daniel Wichs, Security analysis of pseudo-random number generators with input: /dev/random is not robust computer and communications security. pp. 647- 658 ,(2013) , 10.1145/2508859.2516653
Boaz Barak, Shai Halevi, A model and architecture for pseudo-random generation with applications to /dev/random Proceedings of the 12th ACM conference on Computer and communications security - CCS '05. pp. 203- 212 ,(2005) , 10.1145/1102120.1102148
Jaikumar Radhakrishnan, Amnon Ta-Shma, Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators SIAM Journal on Discrete Mathematics. ,vol. 13, pp. 2- 24 ,(2000) , 10.1137/S0895480197329508
Adam Everspaugh, Yan Zhai, Robert Jellinek, Thomas Ristenpart, Michael Swift, Not-So-Random Numbers in Virtualized Linux and the Whirlwind RNG ieee symposium on security and privacy. pp. 559- 574 ,(2014) , 10.1109/SP.2014.42
Eric Wustrow, Zakir Durumeric, J. Alex Halderman, Nadia Heninger, Mining your Ps and Qs: detection of widespread weak keys in network devices usenix security symposium. pp. 35- 35 ,(2012)
Olivier Chevassut, Pierre-Alain Fouque, Pierrick Gaudry, David Pointcheval, The Twist-AUgmented Technique for Key Exchange Public Key Cryptography - PKC 2006. ,vol. 3958, pp. 410- 426 ,(2006) , 10.1007/11745853_27
Z. Gutterman, B. Pinkas, T. Reinman, Analysis of the Linux random number generator ieee symposium on security and privacy. pp. 371- 385 ,(2006) , 10.1109/SP.2006.5
Marion Videau, Patrick Lacharme, Andrea Rock, Vincent Strubel, The Linux Pseudorandom Number Generator Revisited IACR Cryptology ePrint Archive. ,vol. 2012, pp. 251- ,(2012)