Related-key impossible differential attack on a lightweight block cipher MIBS
The strength of MIBS algorithm against the related-key impossible differential attack was examined. MIBS is a lightweight block cipher algorithm. By using the key-expanding properties of MIBS-80 algorithm, a related-key differ-ential feature was presented and a 10-round impossible differential metho...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.02.023/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The strength of MIBS algorithm against the related-key impossible differential attack was examined. MIBS is a lightweight block cipher algorithm. By using the key-expanding properties of MIBS-80 algorithm, a related-key differ-ential feature was presented and a 10-round impossible differential method was constructed by combining special ci-pher-plaintexts. Based on the impossible differential method, an attack to 14-round MIBS-80 algorithm was given, and the attack complexity both on data and on time were gained. Analysis results indicate the attack to MIBS of 14 rounds MIBS-80 algorithm needs 2<sup>54</sup>chosen plaintext operations and 2<sup>56</sup>encrypting computations. |
|---|---|
| ISSN: | 1000-436X |