计算机工程2011，Vol.37Issue(16)：111-113,3.DOI:10.3969/j.issn.1000-3428.2011.16.037
Akelarre分组密码算法的奇偶校验分析
Parity Check Analysis of Akelarre Block Cipher Algorithm
张聪娥 1刘军霞2
作者信息
- 1. 解放军信息工程大学电子技术学院,郑州450004
- 2. 河南省军区通信自动化站,郑州450000
- 折叠
摘要
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关键词
Akelarre分组密码/穷举量/奇偶校验分析/加密算法Key words
Akelarre block cipher/exhaustively quantity/parity check analysis/encryption algorithm分类
信息技术与安全科学引用本文复制引用
张聪娥,刘军霞..Akelarre分组密码算法的奇偶校验分析[J].计算机工程,2011,37(16):111-113,3.
