On the provable security of BEAR and LION schemes

DOI10.1007/S00200-011-0159-ZzbMATH Open1253.94059arXiv1105.0259OpenAlexW1593871619MaRDI QIDQ429778FDOQ429778

Authors: Lara Maines, Matteo Piva, Anna Rimoldi, Massimiliano Sala 

Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: BEAR, LION and LIONESS are block ciphers presented by Biham and Anderson (1996), inspired by the famous Luby-Rackoff constructions of block ciphers from other cryptographic primitives (1988). The ciphers proposed by Biham and Anderson are based on one stream cipher and one hash function. Good properties of the primitives ensure good properties of the block cipher. In particular, they are able to prove that their ciphers are immune to any efficient known-plaintext key-recovery attack that can use as input only one plaintext-ciphertext pair. Our contribution is showing that these ciphers are actually immune to any efficient known-plaintext key-recovery attack that can use as input any number of plaintext-ciphertext pairs. We are able to get this improvement by using slightly weaker hypotheses on the primitives. We also discuss the attack by Morin (1996).

Full work available at URL: https://arxiv.org/abs/1105.0259

Recommendations

• Two practical and provably secure block ciphers: BEAR and LION
• Attacking BEAR and LION schemes in a realistic scenario
• scientific article; zbMATH DE number 4079313
• scientific article; zbMATH DE number 1024070
• scientific article; zbMATH DE number 1418252

zbMATH Keywords

cryptographyhash functionblock cipherstream cipherBEARLIONLuby-Rackoff cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Title not available (Why is that?)
• Two practical and provably secure block ciphers: BEAR and LION
• Faster Luby-Rackoff ciphers

Cited In (3)

• Related-key analysis of generalized Feistel networks with expanding round functions
• Two practical and provably secure block ciphers: BEAR and LION
• Attacking BEAR and LION schemes in a realistic scenario

This page was built for publication: On the provable security of BEAR and LION schemes

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