作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (16): 111-113. doi: 10.3969/j.issn.1000-3428.2011.16.037

• 安全技术 • 上一篇    下一篇

Akelarre分组密码算法的奇偶校验分析

张聪娥 1,刘军霞 2   

  1. (1. 解放军信息工程大学电子技术学院,郑州 450004;2. 河南省军区通信自动化站,郑州 450000)
  • 收稿日期:2011-02-25 出版日期:2011-08-20 发布日期:2011-08-20
  • 作者简介:张聪娥(1964-),女,副教授、硕士,主研方向:密码学,信息安全;刘军霞,高级工程师、硕士

Parity Check Analysis of Akelarre Block Cipher Algorithm

ZHANG Cong-e 1, LIU Jun-xia 2   

  1. (1. Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004, China; 2. Station of Communication Automation of Henan Provincial Area Command, Zhengzhou 450000, China)
  • Received:2011-02-25 Online:2011-08-20 Published:2011-08-20

摘要: Akelarre分组密码算法的圈函数和循环移位操作使其输入输出的奇偶性保持不变,明文和密文间存在一个形式简单的关系式,从而降低算法安全性。为此,提出一种可对任意轮数的Akelarre分组密码算法进行攻击的奇偶校验分析方法。结果表明,该方法在穷举量约为241时,能恢复出输入输出变换的子密钥信息以及密文对应的明文信息。

关键词: Akelarre分组密码, 穷举量, 奇偶校验分析, 加密算法

Abstract: In Akelarre block cipher algorithm, circle function and cycle shift operation makes the same parity input and output, and exists a form of simple equation between expressly and cipher text, it reduces algorithm security. Aiming at the design weakness, this paper presents an improved parity check attack which can apply to any round of the algorithm to Akelarre by employing the weakness. Result shows that this method can obtain the sub-keys and the corresponding plaintexts when the computing complexity of the improving attack is about 241.

Key words: Akelarre block cipher, exhaustively quantity, parity check analysis, encryption algorithm

中图分类号: