Abstract
We show that any scheme to encrypt m blocks of size n bits each, which assures message integrity, is linear in (GF2)n, uses m+k invocations of random functions (from n bits to n bits) and vn bits of randomness, must have k+v at least Ω(logm). This lower bound is proved in a very general model which rules out many promising linear modes of operations for encryption with message integrity. This lower bound is tight as in an earlier paper “Encryption Models with Almost Free Message Integrity”, Proc. Eurocrypt 2001, we show a linear scheme to encrypt m blocks while assuring message integrity by using only m+2+logm invocations of random permutations.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
ANSI X3.106, American National Standard for Information Systems – Data Encryption Algorithm – Modes of Operation, American National Standards Institute (1983)
Bellare, M., Kilian, J., Rogaway, P.: The Security of Cipher Block Chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 341–358. Springer, Heidelberg (1994)
Bellare, M., Namprempre, C.: Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, p. 531. Springer, Heidelberg (2000)
Gligor, V.D., Donescu, P.: Integrity Aware PCBC Encryption Schemes. In: 7th Intl. Workshop on Security Protocols, Cambridge. LNCS (1999)
Gligor, V.D., Donescu, P.: Fast Encryption Authentication: XCBC Encryption and XECB Authentication Modes. In: Proc. Fast Software Encryption 2001 (2001)
ISO 8372, “Information processing – Modes of operation for a 64-bit block cipher algorithm”, International Organization for Standardization, Geneva, Switzerland (1987)
ISO/IEC 9797, Data cryptographic techniques – Data integrity mechanism using a cryptographic check function employing a block cipher algorithm (1989)
Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes (1996)
Jutla, C.S.: Encryption Modes with Almost Free Message Integrity. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, p. 529. Springer, Heidelberg (2001)
Katz, J., Yung, M.: Unforgeable Encryption and Adaptively Secure Modes of Operation. In: Proc. Fast Software Encryption (2000)
Modified PCBC for DES, http://diswww.mit.edu:8008/menelaus.mit.edu/kprot/23
Black, A., Stiglic, A.: Free-Mac Mode, sci.crypt Newsgroup, 2000/03/07
MacLane, S.: Algebra. Macmillan, New York (1967)
Knudsen, L.R., Lai, X., Preneel, B.: Attacks on Fasst Double Block Length Hash Functions. Journal of Cryptology 11(1) (Winter 1998)
Krawczyk, H.: LFSR-based Hashing and Authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129–139. Springer, Heidelberg (1994)
Meyer, C.H., Matyas, S.M.: Cryptography: A New Dimension in Computer Data Security. John Wiley and Sons, New York (1982)
National Institute of Standards and Technology. Recommendation for Block Cipher Modes of Operation, SP 800-38A, http://csrc.nist.gov/publications/nistpubs/index.html
National Bureau of Standards, NBS FIPS PUB 81, DES modes of operation, U. S. Department of Commerce (1980)
RFC 1510, The Kerberos network authentication service (V5), J. Kohl and B.C. Neuman (September 1993)
Rogaway, P., Bellare, M., Black, J., Krovetz, T.: OCB: A Block- Cipher Mode of Operation for Efficient Authenticated Encryption. In: Eighth ACM Conference on Computer and Communications Security (CCS-8), pp. 196–205. ACM Press, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jutla, C.S. (2004). Lower Bound on Linear Authenticated Encryption. In: Matsui, M., Zuccherato, R.J. (eds) Selected Areas in Cryptography. SAC 2003. Lecture Notes in Computer Science, vol 3006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24654-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24654-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21370-3
Online ISBN: 978-3-540-24654-1
eBook Packages: Springer Book Archive