Abstract
The purpose of this paper is to show that there exist DES-like iterated ciphers, which are provably resistant against differential attacks. The main result on the security of a DES-like cipher with independent round keys is Theorem 1, which gives an upper bound to the probability of r-round differentials, as defined in [3] and this upper bound depends only on the round function of the iterated cipher. Moreover, it is shown that there exist functions such that the probabilities of differentials are less than or equal to 22 − n where n is the length of the plaintext block. We also show a prototype of an iterated block cipher, which is compatible with DES and has proven security against differential attacks.
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.
The work of the author on this project is supported by MATINE Board, Finland.
Finnish Defence Forces, University of Helsinki, Helsinki, (on leave)
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
E. Biham, A. Shamir. Differential Cryptanalysis of DES-like Cryptosystems. Journal of Cryptology, Vol. 4 No. 1 1991.
E. Biham, A. Shamir. Differential Cryptanalysis of the full 16-round DES. Technical Report # 708, Technion-Israel Institute of Technology.
X. Lai, J. L. Massey, S. Murphy. Markov Ciphers and Differential Crypt-analysis. Advances in Cryptology-Eurocrypt’ 91. Lecture Notes in Computer Science 547, Springer Verlag.
R. Lidl, H. Niederreiter. Finite Fields. Encyclopedia of Mathematics and its applications, Vol. 20. Addison-Wesley, Reading, Massachusetts, 1983.
T. Matsumoto, H. Imai. Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. Advances in Cryptology — Eurocrypt’ 88. Lecture Notes in Computer Science, Springer Verlag, 1989.
W. Meier, O. Staffelbach. Nonlinearity criteria for cryptographic functions. Proceedings of Eurocrypt’ 89, Springer Verlag 1990, 549–562.
K. Nyberg. Perfect nonlinear S-boxes. Advances in Cryptology-Proceedings of Eurocrypt’ 91. Lecture Notes in Computer Science 547, Springer Verlag.
K. Nyberg. On the construction of highly nonlinear permutations. Advances in Cryptology-Proceedings of Eurocrypt’ 92 (to appear).
J. Pieprzyk. On bent permutations. Technical Report CS91/11; The University of New South Wales.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyberg, K., Knudsen, L.R. (1993). Provable Security Against Differential Cryptanalysis. In: Brickell, E.F. (eds) Advances in Cryptology — CRYPTO’ 92. CRYPTO 1992. Lecture Notes in Computer Science, vol 740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48071-4_41
Download citation
DOI: https://doi.org/10.1007/3-540-48071-4_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57340-1
Online ISBN: 978-3-540-48071-6
eBook Packages: Springer Book Archive