New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis
Proceedings of the Third International Workshop on Fast Software Encryption
The Interpolation Attack on Block Ciphers
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Higher Order Differential Attak of CAST Cipher
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Improving the Higher Order Differential Attack and Cryptanalysis of the KN Cipher
ISW '97 Proceedings of the First International Workshop on Information Security
On MISTY1 Higher Order Differential Cryptanalysis
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
Survey and benchmark of block ciphers for wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
A related-key rectangle attack on the full KASUMI
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A fast calculus for the linearizing attack and its application to an attack on KASUMI
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
| Hi-index | 0.01 |
The encryption algorithm KASUMI is referred to MISTY, proposed by Matsui, is a provably secure against Linear cryptoanalysis and Differential attack. We attacked KASUMI without FL functions by using Higher Order Differential Attack. The necessary order of Higher Order Differential Attack depends on the degree of F function and it is determined by the chosen plaintext. We found effective chosen plaintext which enables the attack to 4 round KASUMI without FL functions. As the result, we can attack it using 2nd order differentials. This attack needs about 1,416 chosen plaintexts.