×

Provable security against a differential attack. (English) Zbl 0817.94016

Summary: The purpose of this paper is to show that DES-like iterated ciphers that are provably resistant against differential attacks exist. 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 \(s\)-round differentials, as defined in [X. Lai and J. L. Massey, Eurocrypt 1991, Lect. Notes Comput. Sci. 547, 17–38 (1991; Zbl 0777.94013)] and this upper bound depends only on the round function of the iterated cipher. Moreover, it is shown that functions exist such that the probabilities of differentials are less than or equal to \(2^{3-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 attack.

MSC:

94A60 Cryptography

Citations:

Zbl 0777.94013
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Biham, E.; Shamir, A., Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, 3-72 (1991) · Zbl 0729.68017
[2] E. Biham and A. Shamir. Differential Cryptanalysis of the Full 16-Round DES. Technical Report No. 708, Technion—Israel Institute of Technology. · Zbl 0809.94017
[3] P. Camion, C. Carlet, P. Charpin, and N. Sendrier. On correlation-immune functions. Advances in Cryptology—Crypto ’91. Lecture Notes in Computer Science, Vol. 576. Springer-Verlag, Berlin, 1992, pp. 86-100. · Zbl 0763.94006
[4] X. Lai, J. L. Massey, and S. Murphy. Markov ciphers and differential cryptanalysis. Advances in Cryptology—Eurocrypt ’91. Lecture Notes in Computer Science, Vol. 547. Springer-Verlag, Berlin, 1992, pp. 17-38. · Zbl 0777.94013
[5] R. Lidl and H. Niederreiter. Finite Fields. Encyclopedia of Mathematics and Its Applications, Vol. 20. Addison-Wesley, Reading, Massachusetts, 1983. · Zbl 0554.12010
[6] W. Meier and O. Staffelbach. Nonlinearity criteria for cryptographic functions. Advances in Cryptology—Eurocrypt ’89. Lecture Notes in Computer Science, Vol. 434. Springer-Verlag, Berlin, 1990, pp. 549-562. · Zbl 0724.94009
[7] K. Nyberg. Perfect nonlinear S-boxes. Advances in Cryptology—Eurocrypt ’91. Lecture Notes in Computer Science, Vol. 547. Springer-Verlag, Berlin, 1991, pp. 378-386. · Zbl 0766.94012
[8] K. Nyberg. On the construction of highly nonlinear permutations. Advances in Cryptology—Eurocrypt ’92. Lecture Notes in Computer Science, Vol. 658. Springer-Verlag, Berlin, 1993, pp. 92-98. · Zbl 0794.94008
[9] K. Nyberg. Differentially uniform mappings for cryptography. Advances in Cryptology—Eurocrypt ’93. Lecture Notes in Computer Science, Vol. 765. Springer-Verlag, Berlin, 1994,pp. 55-64. · Zbl 0951.94510
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.