BEAR and LION ciphers
This article needs additional citations for verification. (October 2017) (Learn how and when to remove this template message)
The BEAR and LION block ciphers were invented by Ross Anderson and Eli Biham by combining a stream cipher and a cryptographic hash function. The algorithms use a very large variable block size, on the order of 213 to 223 bits [clarify]. Both are 3-round generalized (alternating) Feistel ciphers, using the hash function and the stream cipher as round functions. BEAR uses the hash function twice with independent keys, and the stream cipher once. LION uses the stream cipher twice and the hash function once. The inventors proved that an attack on either BEAR or LION that recovers the key would break both the stream cipher and the hash.
- Hoang, Viet Tung; Rogaway, Phillip (2010). "On Generalized Feistel Networks". LNCS 6223. CRYPTO 2010. USA: Springer. pp. 613–630.
- Ross Anderson and Eli Biham. "Two Practical and Provably Secure Block Ciphers: BEAR and LION" (PDF). Retrieved 2007-01-13.
- Pat Morin (1996). Provably Secure and Efficient Block Ciphers. Selected Areas in Cryptography. Archived from the original (PostScript) on 2011-07-06. Retrieved 2009-01-09.
- Pat Morin. "Provably Secure and Efficient Block Ciphers". Retrieved 2017-10-29.
|This cryptography-related article is a stub. You can help Wikipedia by expanding it.|