Related-key impossible boomerang cryptanalysis on LBlock |
| |
Authors: | Min XIE Yan-li MU |
| |
Affiliation: | State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China |
| |
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. |
| |
Keywords: | LBlock algorithm lightweight block cipher related-key impossible boomerang |
|
| 点击此处可从《通信学报》浏览原始摘要信息 |
|
点击此处可从《通信学报》下载全文 |
|