Secure Applications of Low-Entropy Keys (1998) [12 citations — 4 self]
Download:
by John Kelsey, Bruce Schneier, Chris Hall, David Wagner
Lecture Notes in Computer Science
http://www.counterpane.com/low-entropy.pdf
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Kelsey98secureapplications,author = {John Kelsey and Bruce Schneier and Chris Hall and David Wagner},
title = {Secure Applications of Low-Entropy Keys},
booktitle = {Lecture Notes in Computer Science},
year = {1998},
pages = {121--134},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
Abstract. We introduce the notion of key stretching, a mechanism to convert short s-bit keys into longer keys, such that the complexity required to brute-force search a s + t-bit keyspace is the same as the time required to brute-force search a s-bit key stretched by t bits. 1 Introduction—Why Stretch a Key? In many real-world cryptographic systems, we are, for various reasons, limited to encryption keys with relatively low-entropy. In other words, we are limited to a key that is unlikely to take on more than (say) 2 40 different values. This can happen for a variety of reasons: legacy systems that force the use of outdated
