On the complexity of matsui’s attack

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 199-211

  Junod, Pascal ^a  

^a EPFL   (Switzerland)

Author keywords

DES; Linear cryptanalysis

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ATTACK COMPLEXITY; CIPHERTEXTS; COMPLEXITY ANALYSIS; IDLE TIME; LINEAR CRYPTANALYSIS; PLAINTEXT;

CRYPTOGRAPHY;

EID: 84949188947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_16     Document Type: Conference Paper

References (13)

1. E. Biham, A fast new DES implementation in software, FSE’97, LNCS, vol. 1267, Springer-Verlag, 1997, pp. 260-272.
2. U. Blcher and M. Dichtl, Problems with the linear cryptanalysis of DES using more than one active S-box per round, FSE’94, LNCS, vol. 1008, Springer-Verlag, 1995, pp. 265-274.
3. C. Harpes, G. Kramer, and J.L. Massey, A generalization of linear cryptanalysis and the applicability of Matsui’s piling-up lemma, Advances in Cryptology - EuroCrypt’95, LNCS, vol. 921, Springer-Verlag, 1995, pp. 24-38.
4. Z. Kukorelly, The piling-up lemma and dependent random variables, Cryptography and coding: 7th IMA conference, LNCS, vol. 1746, Springer-Verlag, 1999.
5. M. Kwan, Reducing the gate count of bitslice DES, http://eprint.iacr.org/2000/051.ps, 2000.
6. M. Matsui, Linear cryptanalysis method for DES cipher, Advances in Cryptology - EuroCrypt’93, LNCS, vol. 765, Springer-Verlag, 1993, pp. 386-397.
7. 7., The first experimental cryptanalysis of the Data Encryption Standard, Advances in Cryptology - Crypto’94, LNCS, vol. 839, Springer-Verlag, 1994, pp. 1-11.
8. L. May, L. Penna, and A. Clark, An implementation of bitsliced DES on the pentium MMX TM processor, Information Security and Privacy: 5th Australasian Conference, ACISP 2000, LNCS, vol. 1841, Springer-Verlag, 2000.
9. K. Nyberg, Linear approximation of block ciphers, Advances in Cryptology - EuroCrypt’94, LNCS, vol. 950, Springer-Verlag, 1995, pp. 439-444.
10. National Bureau of Standards, Data encryption standard, U. S. Department of Commerce, 1977.
11. A. Rényi, Probability theory, Elsevier, 1970.
12. T. Shimoyama and T. Kaneko, Quadratic relation of s-box and its application to the linear attack of full round DES, Advances in Cryptology - Crypto’98, LNCS, vol. 1462, Springer-Verlag, 1998, pp. 200-211.
13. S. Vaudenay, An experiment on DES statistical cryptanalysis, 3rd ACM Conference on Computer and Communications Security, ACM Press, 1996, pp. 139-147.