|
|
|
| Impossible Differential Cryptanalysis of LBlock Code |
| Guo Jian-sheng① Luo Wei① Zhang Lei② Guo Yuan-bo① |
①(The PLA Information Engineering University, Zhengzhou 450004, China)
②(Unit 65012 of the PLA, Shenyang 110001, China) |
|
|
|
|
Abstract The impossible differential property of LBlock block cipher is analyzed. Based on the property of the structure of round function and the technology of key-byte guessing, two impossible differential attacks on 21-round and 22-round reduced LBlock are presented. It is shown that the attack on 21-round requires about 262 chosen plaintexts and 262 21-round encryptions, and on 22-round requires about 262.5 chosen plaintexts and 263.5 22-round encryptions. The presented results are the best impossible differential attack on reduced-round LBlock so far.
|
|
Received: 26 October 2012
|
|
|
|
Corresponding Authors:
Guo Jian-sheng
E-mail: guojs_crypt@126.com
|
|
|
|
|
|
|
2013, Vol. 35 
