Abstract
We introduce a methodology for designing block ciphers with provable security against differential and linear cryptanalysis. It is based on three new principles: change of the location of round functions, round functions with recursive structure, and substitution boxes of different sizes. The first realizes parallel computation of the round functions without losing provable security, and the second reduces the size of substitution boxes; moreover, the last is expected to make algebraic attacks difficult. We also give specific examples of practical block ciphers that are provably secure under an independent subkey assumption and are reasonably fast in hardware as well as in software implementation.
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
Lai, X., Massey, J.L., Murphy, S.,: Markov Ciphers and Differential Cryptanalysis. Advances in Cryptology — Eurocrypt'91, Lecture Notes in Computer Science 547, Springer-Verlag (1991)
Nyberg, K., Knudsen, L.,: Provable Security against Differential Cryptanalysis. Journal of Cryptology, Vol.8, no. 1 (1995)
Nyberg, K.,: Linear Approximation of Block Ciphers. Advances in Cryptology — Eurocrypt'94, Lecture Notes in Computer Science 950, Springer-Verlag (1994)
Nyberg, K.,: Differential Uniform Mappings for Cryptography. Advances in Cryptology — Eurocrypt'93, Lecture Notes in Computer Science 765, Springer-Verlag (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsui, M. (1996). New structure of block ciphers with provable security against differential and linear cryptanalysis. 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_54
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_54
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