This website does readability filtering of other pages. All styles, scripts, forms and ads are stripped. If you want your website excluded or have other feedback, use this form.

Academic: Secure Applications of Low-Entropy Keys - Schneier on Security

Schneier on Security

Academic >

Secure Applications of Low-Entropy Keys

J. Kelsey, B. Schneier, C. Hall, and D. Wagner

1997 Information Security Workshop (ISW'97), September 1997, pp. 121-134.

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.

[full text - postscript] [full text - PDF (Acrobat)]

Categories: Cipher Design

← An Improved E-Mail Security Protocol Cryptographic Support for Secure Logs on Untrusted Machines →

Photo of Bruce Schneier by Per Ervland.

Schneier on Security is a personal website. Opinions expressed are not necessarily those of IBM Resilient.