Differential cryptanalysis of the data encryption standard
Differential cryptanalysis of the data encryption standard
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques 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
New Results on Boomerang and Rectangle Attacks
FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Improved and Multiple Linear Cryptanalysis of Reduced Round Serpent
Information Security and Cryptology
Bit-Pattern Based Integral Attack
Fast Software Encryption
Multidimensional Linear Cryptanalysis of Reduced Round Serpent
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
On quadratic approximations in block ciphers
Problems of Information Transmission
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
On Linear Cryptanalysis with Many Linear Approximations
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
A linear analysis of Blowfish and Khufu
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Improving the time complexity of Matsui's linear cryptanalysis
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
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
Multimedia Tools and Applications
Hi-index | 0.00 |
Serpent is one of the 5 AES finalists. In this paper we present a 9-round linear approximation for Serpent with probability of 1/2+2-52. We use it to attack 10-round Serpent with all key lengths with data complexity of 2118 and running time of 289. A variant of this approximation is used in the first attack against an 11-round Serpent with 192-bit and 256-bit keys, which require the same amount of data and 2187 running time.