Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Iterative Characteristics of DES and s²-DES
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Linear Cryptanalysis Using Multiple Approximations
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Improving the Search Algorithm for the Best Linear Expression
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
The Rectangle Attack - Rectangling the Serpent
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Linear Cryptanalysis of Reduced Round Serpent
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
New Results on Boomerang and Rectangle Attacks
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Bit-Pattern Based Integral Attack
Fast Software Encryption
Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
Fast Software Encryption
A Differential-Linear Attack on 12-Round Serpent
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent
Information Security and Cryptology --- ICISC 2008
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
On Linear Cryptanalysis with Many Linear Approximations
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
On multidimensional linear cryptanalysis
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Improving the algorithm 2 in multidimensional linear cryptanalysis
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
| Hi-index | 0.00 |
This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We first present a 9-round linear characteristic with probability $\frac{1}{2}+2^{-50}$ that involves a reduction of the estimated data complexity of the best reported attack by a factor of 16. Then, we investigate the possibility to take advantage of multiple linear approximations for improving the linear cryptanalysis of Serpent. According to the framework of Biryukov et al.from Crypto 2004, we provide estimations of the improved data complexity of such attacks and derive practical cryptanalysis scenarios. For computational reasons, the branch-and-bound search is not guaranteed to be optimal. However, these are the best reported complexities of a linear attack against Serpent.