Sciweavers

583 search results - page 1 / 117
» On the Complexity of Matsui's Attack
Sort
View
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
On the Complexity of Matsui's Attack
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evalua...
Pascal Junod
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 6 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...
ICISC
2008
146views Cryptology» more  ICISC 2008»
13 years 6 months ago
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Abstract. In this paper, we present a new technique for Matsui's algorithm 2 using multidimensional linear approximation. We show that the data complexity of the attack can be...
Joo Yeon Cho, Miia Hermelin, Kaisa Nyberg
EUROCRYPT
1995
Springer
13 years 8 months ago
A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma
Matsui's linear cryptanalysis for iterated block ciphers is generalized by replacing his linear expressions with I O sums. For a single round, an I O sum is the XOR of a balan...
Carlo Harpes, Gerhard G. Kramer, James L. Massey
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...