On the provable security of BEAR and LION schemes

DOI10.1007/s00200-011-0159-zzbMath1253.94059arXiv1105.0259OpenAlexW1593871619MaRDI QIDQ429778

Massimiliano Sala, Lara Maines, Matteo Piva, Anna Rimoldi

Publication date: 20 June 2012

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

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

zbMATH Keywords

cryptographyblock cipherhash functionstream cipherBEARLIONLuby-Rackoff cipher

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Related-key analysis of generalized Feistel networks with expanding round functions ⋮ Attacking BEAR and LION Schemes in a Realistic Scenario

Cites Work

• Unnamed Item
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Two practical and provably secure block ciphers: BEAR and LION
• Faster Luby-Rackoff ciphers

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