FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Improved Cryptanalysis of Rijndael
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
Impossible Differential Cryptanalysis of CLEFIA
Fast Software Encryption
Impossible Differential Analysis of Reduced Round CLEFIA
Information Security and Cryptology
Square like attack on camellia
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Improving integral attacks against Rijndael-256 up to 9 rounds
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Integral attacks on reduced-round ARIA block cipher
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
The 128-bit blockcipher CLEFIA
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Hi-index | 0.00 |
In this paper a new 9-round integral distinguisher of CLEFIA is proposed based on byte-pattern, which is proved in detail. Then by using the partial sum technique we improve the previous result on 11-round CLEFIA and proposed integral attack on 12-, 13- and 14- round CLEFIA with the whitening keys. The 12-round CLEFIA-128/192/256 is attacked with data complexity 2113 and time complexity 2116.7, 13-round CLEFIA-192/256 is attacked with data complexity 2113 and time complexity 2180.5, and 14-round CLEFIA-256 is breakable with data complexity 2113 and time complexity 2244.5. These results demonstrate that based on the byte-pattern we can improve the integral attacks on CLEFIA two more rounds than those given by the designers.