On the provable security of BEAR and LION schemes

Details On the provable security of BEAR and LION schemes On the provable security of BEAR and LION schemes

2011-05-02

arxiv.org/abs/1105.0259v1

Computer Science

Cryptography and Security

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

On the provable security of BEAR and LION schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the provable security of BEAR and LION schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the provable security of BEAR and LION schemes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426622