Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
An experiment on DES statistical cryptanalysis
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
An Implementation of Bitsliced DES on the Pentium MMXTM Processor
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Quadratic Relation of S-box and Its Application to the Linear Attack of Full Round DES
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Fast New DES Implementation in Software
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
A generalization of linear cryptanalysis and the applicability of Matsui's piling-up lemma
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
An FPGA Implementation of the Linear Cryptanalysis
FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
Fast Software Encryption
Multidimensional Linear Cryptanalysis of Reduced Round Serpent
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
On Linear Cryptanalysis with Many Linear Approximations
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
On unbiased linear approximations
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Accurate estimates of the data complexity and success probability for various cryptanalyses
Designs, Codes and Cryptography
New improvements of davies-murphy cryptanalysis
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On the success probability of χ2-attack on RC6
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Zero correlation linear cryptanalysis with reduced data complexity
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
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 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 241 DES evaluations in 85% of the case, while more than the half of the experiments needed less than 239 DES evaluations. In addition, we give a detailed theoretical analysis of the attack complexity.