Playing Hide and Seek With Stored Keys

DMCA

Playing Hide and Seek With Stored Keys (1998)

Cached

Download Links

by Adi Shamir And , Adi Shamir , Nicko Van Someren

Venue:

Lecture Notes in Computer Science

BibTeX

@INPROCEEDINGS{And98playinghide,
    author = {Adi Shamir And and Adi Shamir and Nicko Van Someren},
    title = {Playing Hide and Seek With Stored Keys},
    booktitle = {Lecture Notes in Computer Science},
    year = {1998},
    pages = {118--124}
}

OpenURL

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 authenticode type mechanisms in software packages. Keywords: Cryptanalysis, lunchtime attacks, RSA, authenticode, key hiding. 1 Introduction In this paper we consider the problem of efficiently locating cryptographic keys in large amounts of data. As a motivating example, consider a financial institute which uses the manager's PC to digitally sign wire transfers. In our lunchtime attack scenario, the attacker (who can be a secretary, technician, customer, etc.) can sneak into the manager's office for a ...

Keyphrases

stored key lunchtime attack cryptographic key financial institute wire transfer motivating example arbitrary cryptographic key lunchtime attack scenario long bit string signature key software package large program general statistical attack secret rsa key key hiding typical pc large amount complete file system efficient algebraic attack authenticode type mechanism

DMCA