Abstract
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a polynomially bounded adversary. In this paper it is shown that this construction suffers from severe limitations that are immediately apparent if differential cryptanalysis [3] is performed. The fact that these limitations do not contradict the theoretical results obtained in [1] leads the authors to question the relevance of computational complexity theory in practical conventional cryptography.
Preview
Unable to display preview. Download preview PDF.
References
S. Even, Y. Mansour, A Construction of a Cipher From a Single Pseudorandom Permutation, Lecture Notes in Computer Science, Proceedings Asiacrypt '91, Springer-Verlag 1992.
J. Daemen, A Framework for the Design if One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on a Cellular Automaton, Lecture Notes in Computer Science, Proceedings Asiacrypt '91, Springer-Verlag 1992.
E. Biham, A. Shamir, Differential Cryptanalysis of DES-like Cryptosystems, Abstracts of Crypto '90, 1–32.
M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373–386,April 1988.
O. Goldreich, S. Goldwasser and S. Micali, How to Construct Random Functions, Proceedings of the 25th Annual Symposium on Foundations of Computer Science, October 24–26, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daemen, J. (1993). Limitations of the Even-Mansour construction. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_46
Download citation
DOI: https://doi.org/10.1007/3-540-57332-1_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57332-6
Online ISBN: 978-3-540-48066-2
eBook Packages: Springer Book Archive