(Enter summary)
Abstract: In this paper we consider the problem of efficiently locating
cryptographic keys hidden in gigabytes of data, such as the
complete file system of a typical PC. We describe efficient algebraic
attacks which can locate secret RSA keys in long bit
strings, and more general statistical attacks which can find
arbitrary cryptographic keys embedded in large programs.
These techniques can be used to apply lunchtime attacks on
signature keys used by financial institutes, or to defeat
... (Update)
Similar documents based on text: More All
0.4: Key Generation with Implicit Key Recovery - Harvey, van Someren (2000)
(Correct)
0.1: Overloading Intentions for Efficient Practical Reasoning - Pollack (1991)
(Correct)
0.1: Applying Differential Cryptanalysis to DES Reduced to 5 Rounds - Tay (1997)
(Correct)
BibTeX entry: (Update)
N. van Someren and A. Shamir. Playing hide and seek with stored keys. Available online at http://www.ncipher.com/products/rscs/ downloads/whitepapers/keyhide2.pdf, 1998. http://citeseer.ist.psu.edu/vansomeren98playing.html More
@article{ shamir99playing,
author = "Adi Shamir and Nicko van Someren",
title = "Playing ``Hide and Seek'' with Stored Keys",
journal = "Lecture Notes in Computer Science",
volume = "1648",
pages = "118--124",
year = "1999",
url = "citeseer.ist.psu.edu/vansomeren98playing.html" }
Citations (may not include all citations):
8
Cryptographic communications system and method (context) - Rivest, Shamir et al. - 1983
2
Lecture Notes in Computer Science: Information Hiding (context) - Aucsmith, software - 1996
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC