Abstract
In this paper we suggest two new provably secure block ciphers, called BEAR and LION. They both have large block sizes, and are based on the Luby-Rackoff construction. Their underlying components are a hash function and a stream cipher, and they are provably secure in the sense that attacks which find their keys would yield attacks on one or both of the underlying components. They also have the potential to be much faster than existing block ciphers in many applications.
Chapter PDF
Similar content being viewed by others
References
RJ Anderson, “Solving a Class of Stream Ciphers”, in Cryptologia v XIV no 3 (July 1990) pp 285–288
RJ Anderson, “The classification of hash functions”, in Codes and Cyphers — Cryptography and Coding IV (IMA, 1995) pp 83–93
M Bellare, J Kilian, P Rogaway, “The Security of Cipher Block Chaining”, in Advances in Cryptology — CRYPTO 94, Springer LNCS v 839 pp 341–358
E Biham, A Shamir, ‘Differential Cryptanalysis of the Data Encryption Standard’ (Springer 1993)
H Krawczyk, “LFSR-based Hashing and Authentication”, in Advances in Cryptology — CRYPTO 94, Springer LNCS v 839 pp 129–139
BS Kaliski, MR Robshaw, “Fast Block Cipher Proposal”, in Fast Software Encryption, Springer LNCS 809 (1994) pp 33–40
Luby, C Rackoff, “How to construct pseudorandom permutations from pseduorandom functions”, in SIAM Journal on Computing v 17 no 2 (1988) pp 373–386
XJ Lai, RA Rueppel, J Woollven, in preproceedings of Auscrypt 92 pp 8-7–8-11
U Maurer, “A Simplified and Generalized Treatment of Luby-Rackoff Pseudo-random Permutation Generators”, in Advances in Cryptology — EUROCRYPT 92, Springer LNCS v 658 pp 239–255
M Matsui, “The first experimental cryptanalysis of the Data Encryption Standard”, in Advances in Cryptology — CRYPTO 94, Springer LNCS v 839 pp 1–11
WB Mao, C Boyd, “Classification of Cryptographic Techniques in Authentication Protocols”, in Workshop on Selected Areas in Cryptography (SAC 94) — Workshop Record, pp 95–104
B Preneel, 'Analysis and Design of Cryptographic Hash Functions', PhD Thesis, Katholieke Universiteit Leuven, 1993
M Roe, “Algorithms Contest — Preliminary Results”, preprint handed out at KU Leuven workshop on algorithms
P Rogaway, D Coppersmith, “A Software-Optimised Encryption Algorithm”, in Fast Software Encryption, Springer LNCS 809 (1994) pp 56–63
B Schneier, MA Blaze, “McGuffin: an unbalanced Feistel network block cipher”, in KU Leuven Workshop on Cryptographic Algorithms, preproceedings p 44
G Tsudik, “Message Authentication with One-Way Hash Functions”, in Computer Communications Review v 22 no 5 pp 29–38
S Vaudenay, ‘La Sécurité des Primitives Cryptographiques',Thèse de Doctorat, Laboratoire d'Informatique de l'Ecole Normale Supérieure, Avril 1995
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anderson, R., Biham, E. (1996). Two practical and provably secure block ciphers: BEAR and LION. In: Gollmann, D. (eds) Fast Software Encryption. FSE 1996. Lecture Notes in Computer Science, vol 1039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60865-6_48
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60865-3
Online ISBN: 978-3-540-49652-6
eBook Packages: Springer Book Archive