Secure applications of low-entropy keys

DOI10.1007/BFB0030415MaRDI QIDQ4251011zbMATH OpenFDO

Authors John Kelsey, Bruce Schneier, Chris Hall, David Wagner

Publication date 15 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0030415

zbMATH Keywords

key stretching

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

The authors 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 an \(s\)-bit key stretched by \(t\) bits. In Section 2 they describe a general framework for key-stretching algorithms. In Section 3 they describe various classes of attack that are possible on key-stretching algorithms, and some design principles that allow us to resist these attacks. In Section 4 they describe two different key stretching algorithms: one based on one-way hash function, and the other on a block cipher. They are able to give proofs, under some reasonable assumptions, that any attacks on the hash-based scheme translate into attacks on the underlying cryptographic primitive. Finally, in Section 5, we discuss extensions to frustrate brute-force attacks which make use of massively parallel devices. For the entire collection see [Zbl 0888.00019].

Recommendations

• Design and Analysis of Password-Based Key Derivation Functions
• Topics in Cryptology – CT-RSA 2005
• Information Security
• A cryptanalytic time-memory trade-off
• New Constructions for Secure Hash Functions

Cited in

(15)

• scientific article; zbMATH DE number 1583805 (Why is no real title available?)
• scientific article; zbMATH DE number 1588481 (Why is no real title available?)
• Universal security. From bits and mips to pools, lakes -- and beyond
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• New Paradigms for Password Security
• Design and Analysis of Password-Based Key Derivation Functions
• Applied Cryptography and Network Security
• Applied Cryptography and Network Security
• scientific article; zbMATH DE number 1857539 (Why is no real title available?)
• Honey encryption: security beyond the brute-force bound
• Information Security
• Topics in Cryptology – CT-RSA 2005
• Some (in)sufficient conditions for secure hybrid encryption
• Universally composable password-hardened encryption
• Multiple hashes of single key with passcode for multiple accounts

This page was built for publication: Secure applications of low-entropy keys

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4251011)