轻量级分组密码算法MIBS不可能差分分析

J4 ›› 2012, Vol. 47 ›› Issue (7): 55-58.

轻量级分组密码算法MIBS不可能差分分析

杜承航^1,2,陈佳哲^1,2

1.山东大学数学学院, 山东济南 250100;
2. 山东大学密码技术与信息安全教育部重点实验室, 山东济南 250100

收稿日期:2011-05-31 出版日期:2012-07-20 发布日期:2012-09-01
作者简介:杜承航(1982- ),男,博士研究生,主要研究方向为对称密码分析与设计.Email:chenghangdu@mail.sdu.edu.cn
基金资助:
国家自然科学基金资助项目(60931160442);山东大学研究生自主创新基金资助项目(11140070613183)

Impossible differential cryptanalysis of reduced-round MIBS

DU Cheng-hang^1,2, CHEN Jia-zhe^1,2

1. School of Mathematics, Shandong University, Jinan 250100, Shandong, China;
2. Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education,
Shandong University, Jinan 250100, Shandong, China

Received:2011-05-31 Online:2012-07-20 Published:2012-09-01

摘要/Abstract

摘要：

轻量级分组密码算法适用于RFID等计算资源严格受限的环境。指出之前Asli Bay等人不可能差分分析结果的错误,并提出新的不可能差分分析。提出对约减至12轮的MIBS算法的攻击,此攻击需259选择明文和263次加密运算。

关键词: 轻量级分组密码;MIBS;不可能差分分析

Abstract:

MIBS is suitable for extremely constrained environments, such as RFID tags. Based on the analysis of the flaw in Asli Bay’s work, a new impossible differential cryptanalysis is proposed. The attack of MIBS reduced to 12 rounds needs 259chosen plaintexts and 263encryptions.

Key words: lightweight block cipher; MIBS; impossible differential cryptanalysis

杜承航1,2,陈佳哲1,2. 轻量级分组密码算法MIBS不可能差分分析[J]. J4, 2012, 47(7): 55-58.

DU Cheng-hang1,2, CHEN Jia-zhe1,2. Impossible differential cryptanalysis of reduced-round MIBS[J]. J4, 2012, 47(7): 55-58.

参考文献

多维度评价

Viewed

Full text

Abstract

Cited

Shared

Discussed