| 基于减轮KASUMI的f9算法单密钥攻击 |
| |
| 引用本文： | 徐新龙,韩文报.基于减轮KASUMI的f9算法单密钥攻击[J].电子与信息学报,2013,35(2):303-309. |
| |
| 作者姓名： | 徐新龙 韩文报 |
| |
| 作者单位： | 信息工程大学信息工程学院 郑州450002 |
| |
| 基金项目： | 国家自然科学基金(61003291)资助课题 |
| |
| 摘 要： | 该文对4轮KASUMI的f9算法进行了单密钥攻击.把中间相遇攻击的思想用到f9算法攻击中,选取了基础密钥集与穷举密钥集,利用K3与明文之间的线性关系对f9算法进行了中间相遇攻击,同时利用碰撞与查表技术减少了计算复杂度.最后恢复所有128 bit密钥需要数据复杂度是232,优化后的计算复杂度是2125.85,存储复杂度是236.
|
| 关 键 词： | 密码学 f9算法 KASUMI算法 中间相遇攻击 |
| 收稿时间： | 2012-06-11 |
A Single Key Attack on Reduced-round KASUMI-based f9 Algorithm |
| |
| Xu Xin-long
,
Han Wen-bao.A Single Key Attack on Reduced-round KASUMI-based f9 Algorithm[J].Journal of Electronics & Information Technology,2013,35(2):303-309. |
| |
| Authors: | Xu Xin-long Han Wen-bao |
| |
| Affiliation: | Institute of Information Engineering, Information Engineering University, Zhengzhou 450002, China |
| |
| Abstract: | An attack on f9 algorithm based on 4-round KASUMI is given with a single-key method. The meet-in -the-middle thought is applied into the attack and the based key set and the exhaustive key set are chosen. Then f9 algorithm is attacked with the linear relationship between plaintext and K3. At the same time, collision properties and table-lookups are applied to reduce the time complexity. As a result, with 232 plaintexts with the corresponding MACs, the attack needs 2125.85 f9 calculations with 236 memory to recovery all the key. |
| |
| Keywords: | Cryptography f9 algorithm KASUMI algorithm Meet-in-the-middle attack |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
|
