Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cryptanalysis of Five Rounds of CRYPTON Using Impossible Differentials
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
A Revised Version of Crypton - Crypton V1.0
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Attack on Six Rounds of Crypton
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Impossible differential cryptanalysis of 7-round advanced encryption standard (AES)
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Survey and benchmark of block ciphers for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Impossible differential cryptanalysis of reduced-round ARIA and Camellia
Journal of Computer Science and Technology
A Meet-in-the-Middle Attack on 8-Round AES
Fast Software Encryption
Improved Impossible Differential Attacks on Large-Block Rijndael
ISC '08 Proceedings of the 11th international conference on Information Security
New Impossible Differential Attacks on AES
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
A taxonomy of security attacks on the advanced encryption standard
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Improved Meet-in-the-Middle Attacks on AES
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Improved related-key impossible differential attacks on reduced-round AES-192
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Dial C for cipher: le chiffrement était presque parfait
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
A linear analysis of Blowfish and Khufu
ISPEC'07 Proceedings of the 3rd international conference on Information security practice and experience
Consistent differential patterns of Rijndael
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
New impossible differential attacks on reduced-round Crypton
Computer Standards & Interfaces
New results on impossible differential cryptanalysis of reduced AES
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
The (related-key) impossible boomerang attack and its application to the AES block cipher
Designs, Codes and Cryptography
New impossible differential and known-key distinguishers for the 3D cipher
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
New multiset attacks on rijndael with large blocks
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
The cryptanalysis of the AES – a brief survey
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
The boomerang attack on 5 and 6-round reduced AES
AES'04 Proceedings of the 4th international conference on Advanced Encryption Standard
Related-key rectangle attacks on reduced AES-192 and AES-256
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Impossible-differential attacks on large-block Rijndael
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.01 |
Impossible differential attacks against Rijndael and Crypton have been proposed up to 5-round. In this paper we expand the impossible differential attacks to 6-round. Although we use the same 4-round impossible differential as in five round attacks, we put this impossible differential in the middle of 6-round. That is, we will consider one round before the impossible differential and one more round after. The complexity of the proposed attack is bigger than that of the Square attack, but still less than that of the exhaustive search.