On Linear Cryptanalysis with Many Linear Approximations
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Multi-trail statistical saturation attacks
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
On unbiased linear approximations
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
On linear hulls, statistical saturation attacks, PRESENT and a cryptanalysis of PUFFIN
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Improving the algorithm 2 in multidimensional linear cryptanalysis
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Multidimensional linear distinguishing attacks and Boolean functions
Cryptography and Communications
Linear cryptanalysis of reduced-round PRESENT
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Dependent linear approximations: the algorithm of biryukov and others revisited
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Correlation attacks on combination generators
Cryptography and Communications
Multiple differential cryptanalysis using LLR and χ2
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Integral and multidimensional linear distinguishers with correlation zero
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Hi-index | 0.00 |
Matsui's one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on established statistical theory is presented. Two possible methods, an optimal method based on the log-likelihood ratio and a 驴 2-based goodness-of-fit test are compared in theory and by practical experiments on reduced round Serpent. The theory of advantage by Selçuk is generalised in multiple dimensions and the advantages and data, time and memory complexities for both methods are derived.