Improved integral attacks on reduced-round CLEFIA block cipher

  • Authors:
  • Yanjun Li;Wenling Wu;Lei Zhang

  • Affiliations:
  • State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China;State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China

  • Venue:
  • WISA'11 Proceedings of the 12th international conference on Information Security Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.