On the Complexity of Matsui's Attack

@inproceedings{Junod2001OnTC,
  title={On the Complexity of Matsui's Attack},
  author={Pascal Junod},
  booktitle={Selected Areas in Cryptography},
  year={2001}
}
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 2 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 2 DES evaluations in 85 % of the cases for recovering the key. In this paper, we present a theoretical and experimental complexity analysis of this attack, which has been simulated 21 times using the idle time of several computers. The experimental results suggest a complexity upper-bounded by 2 DES evaluations in 85 % of the case… CONTINUE READING

Similar Papers

Loading similar papers…