Journal on Communications ›› 2017, Vol. 38 ›› Issue (5): 66-71.doi: 10.11959/j.issn.1000-436x.2017101

• Papers • Previous Articles     Next Articles

Related-key impossible boomerang cryptanalysis on LBlock

Min XIE,Yan-li MU   

  1. State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
  • Revised:2017-03-16 Online:2017-05-01 Published:2017-05-28
  • Supported by:
    The National Natural Science Foundation of China(61373170);The National Natural Science Foundation of China(U0835004);The National Natural Science Foundation of China(U1536202);The 111 Project of China(B08038)

Abstract:

The related-key impossible boomerang cryptanalysis and the strength of the lightweight block cipher LBlock against this method were investigated.A new attack on 22-round LBlock was presented combining impossible boomerang attacks with related-key attacks.A 15-round related-key impossible boomerang distinguisher was constructed.Based on the new distinguisher,an attack on 22-round LBlock was mounted successfully by concatenating 3-round to the beginning and 4-round to the end.The attack on 22-round LBlock required data complexity of only 251.3plaintexts and computational complexity of about 2 71.5422-round encryptions.Compared with published cryptanalysis results on 22-round LBlock,proposed attack has great advantages on data and computational complexities.

Key words: LBlock algorithm, lightweight block cipher, related-key, impossible boomerang

CLC Number: 

No Suggested Reading articles found!