计算机工程 ›› 2012, Vol. 38 ›› Issue (9): 155-157,179.doi: 10.3969/j.issn.1000-3428.2012.09.047

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

1~5轮LBlock的多项式表示及完全性分析

彭昌勇1,2,祝跃飞1,顾纯祥1,米顺强3   

  1. (1. 解放军信息工程大学信息工程学院,郑州 450002;2. 解放军信息工程大学理学院,郑州 450001; 3. 解放军95833部队,北京 100092)
  • 收稿日期:2011-02-10 出版日期:2012-05-05 发布日期:2012-05-05
  • 作者简介:彭昌勇(1974-),男,博士研究生,主研方向:分组密码;祝跃飞,教授、博士;顾纯祥,副教授、博士;米顺强,助理研究员
  • 基金项目:
    郑州市科技创新团队基金资助项目(10CXTD150)

Polynomial Expression and Completeness Analysis of 1~5 Round LBlock

PENG Chang-yong 1,2, ZHU Yue-fei 1, GU Chun-xiang 1, MI Shun-qiang 3   

  1. (1. Institute of Information Engineering, PLA Information Engineering University, Zhengzhou 450002, China; 2. School of Science, PLA Information Engineering University, Zhengzhou 450001, China; 3. 95833 PLA Troops, Beijing 100092, China)
  • Received:2011-02-10 Online:2012-05-05 Published:2012-05-05

摘要: 用统计测试方法分析密码算法的完全性存在误差。为此,利用符号计算软件Mathematica 7.0,以明文和密钥比特为自变量,得到LBlock分组密码第1轮~第5轮输出的多项式表达式,结果显示,LBlock第5轮输出的任何比特至多与45个明文比特、49个密钥比特有关,说明5轮LBlock还未达到完全性。

关键词: 完全性, 分组密码, LBlock密码, 多项式表示, 符号计算, Mathematica软件

Abstract: There are errors in analyzing the completeness of a cryptographic algorithm by statistical testing method. By using the symbolic computation software Mathematica 7.0, the polynomial expressions(in terms of the plaintext bits and key bits) of the output of 1~5 round of the block cipher LBlock are obtained. The result shows that any bit of the output of the 5th round of LBlock depends on at most 45 plaintext bits and 49 key bits, which means that 5-round LBlock is not complete.

Key words: completeness, block cipher, LBlock cipher, polynomial expression, symbolic computation, Mathematica

中图分类号: