CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the security of the IDEA block cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Square-like Attacks on Reduced Rounds of IDEA
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Key-Schedule Cryptoanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
CRYPTO '96 Proceedings of the 16th 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
On Applying Linear Cryptanalysis to IDEA
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Miss in the Middle Attacks on IDEA and Khufu
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Amplified Boomerang Attacks Against Reduced-Round MARS and Serpent
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
FSE '02 Revised Papers from the 9th 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
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Markov ciphers and differential cryptanalysis
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
New combined attacks on block ciphers
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
New attacks against reduced-round versions of IDEA
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Related-Key boomerang and rectangle attacks
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
A Unified Approach to Related-Key Attacks
Fast Software Encryption
Reflection Cryptanalysis of Some Ciphers
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
The Key-Dependent Attack on Block Ciphers
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The delicate issues of addition with respect to XOR differences
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Notions and relations for RKA-secure permutation and function families
Designs, Codes and Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
On the (in)security of IDEA in various hashing modes
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
Collisions for the WIDEA-8 compression function
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
| Hi-index | 0.00 |
IDEA is a 64-bit block cipher with 128-bit keys introduced by Lai and Massey in 1991. IDEA is one of the most widely used block ciphers, due to its inclusion in several cryptographic packages, such as PGP and SSH. The cryptographic strength of IDEA relies on a combination of three incompatible group operations – XOR, addition and modular multiplication. Since its introduction in 1991, IDEA has withstood extensive cryptanalytic effort, but no attack was found on the full variant of the cipher. In this paper we present the first known non-trivial relation that involves all the three operations of IDEA. Using this relation and other techniques, we devise a linear attack on 5-round IDEA that uses 219 known plaintexts and has a time complexity of 2103 encryptions. By transforming the relation into a related-key one, a similar attack on 7.5-round IDEA can be applied with data complexity of 243.5 known plaintexts and a time complexity equivalent to 2115.1 encryptions. Both of the attacks are by far the best known attacks on IDEA