Secure applications of low-entropy keys

  • John Kelsey
  • Bruce Schneier
  • Chris Hall
  • David Wagner
Key Management

DOI: 10.1007/BFb0030415

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1396)
Cite this paper as:
Kelsey J., Schneier B., Hall C., Wagner D. (1998) Secure applications of low-entropy keys. In: Okamoto E., Davida G., Mambo M. (eds) Information Security. ISW 1997. Lecture Notes in Computer Science, vol 1396. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • John Kelsey
    • 1
  • Bruce Schneier
    • 1
  • Chris Hall
    • 1
  • David Wagner
    • 2
  1. 1.Counterpane SystemsMinneapolis
  2. 2.Soda Hall, C.S. DivisionU. C. BerkeleyBerkeley

Personalised recommendations