J4 ›› 2014, Vol. 41 ›› Issue (5): 173-179.doi: 10.3969/j.issn.1001-2400.2014.05.029

• Original Articles • Previous Articles     Next Articles

Cryptanalysis of the LBlock using multiple zero-correlation linear approximations

LUO Fang;ZHOU Xueguang;OU Qingyu   

  1. (Department of Information Security, Naval University of Engineering, Wuhan  430033, China)
  • Received:2013-07-10 Online:2014-10-20 Published:2014-11-27
  • Contact: LUO Fang E-mail:lf_0215@sina.com

Abstract:

In order to reduce the data complexity of zero-correlation linear cryptanalysis of the LBlock, cryptanalysis of the LBlock using multiple zero-correlation linear approximations is presented. 26 zero-correlations for 14 the round LBlock is proven, and its construction is given. The normal distribution probability model is applied to attack the 22 round LBlock, with the 26 zero-correlations for the 14 round LBlock used as the distinguisher. The data complexity of the cryptanalysis is about 263.45 known plaintexts, the computing complexity is about 276.27, and the success probability is 0.85. It is proved that the problem that the whole plaintext is needed to cryptanalyze the LBlock is solved.

Key words: lightweight block cipher, LBlock cipher, multiple zero-correlation linear approximation, cryptanalysis, data complexity

CLC Number: 

  • TN918.1

Baidu
map