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.
References
M. Abadi, personal communication.
[BDRSSTW96] M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Wiener, “Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security,” January 1996.
H. Dobbertin, A. Bosselaers, and B. Preneel, “RIPEMD-160: A Strengthened Version of RIPEMD,” Fast Software Encryption: Third International Workshop, Cambrdige, UK, February 1996 Proceedings, Springer-Verlag, 1996, pp. 71–82.
M.E. Hellman, “A Cryptanalytic Time-Memory Trade Off,” IEEE Transactions on Information Theory, v. 26, n. 4, Jul 1980, pp. 401–406.
D. Knuth, The Art of Computer Programming: Volume 2, Seminumerical Algorithms, Addison-Wesley, 1981.
U. Manber, “A Simple Scheme to Make Passwords Based on One-Way Functions Much Harder to Crack,” Computers & Security, v. 15, n. 2, 1996, pp. 171–176.
R.H. Morris and K. Thompson, “UNIX Password Security,” Communications of the ACM, v. 22, n. 11, Nov 1979.
National Bureau of Standards, NBS FIPS PUB 46, “Data Encryption Standard,” National Bureau of Standards, U.S. Department of Commerce, Jan 1977.
National Institute of Standards and Technology, NIST FIPS PUB 180, “Secure Hash Standard,” U.S. Department of Commerce, May 93.
J.-J. Quisquater, Y. Desmedt, and M. Davio, “The Importance of ‘Good’ Key Schemes (How to Make a Secure DES with ≤ 48 Bit Keys?),” Advances in Cryptology—CRYPTO '85 Proceedings, Springer-Verlag, 1986, pp. 537–542.
B. Schneier, Applied Cryptography, Second Edition, John Wiley & Sons, 1996.
Peter Trei, personal communication, 1997.
M. Wiener, “Efficient DES Key Search,” TR-244, School of Computer Science, Carleton Unversity, May 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/BFb0030415
Download citation
DOI: https://doi.org/10.1007/BFb0030415
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64382-1
Online ISBN: 978-3-540-69767-1
eBook Packages: Springer Book Archive