计算机工程2012，Vol.38Issue(9)：155-157,179,4.DOI:10.3969/j.issn.1000-3428.2012.09.047
1～5轮LBlock的多项式表示及完全性分析
Polynomial Expression and Completeness Analysis of 1～5 Round LBlock
摘要
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.关键词
完全性/分组密码/LBlock密码/多项式表示/符号计算/Mathematica软件Key words
completeness/ block cipher/ Lblock cipher/ polynomial expression/ symbolic computation/ Mathematica分类
信息技术与安全科学引用本文复制引用
彭昌勇,祝跃飞,顾纯祥,米顺强..1～5轮LBlock的多项式表示及完全性分析[J].计算机工程,2012,38(9):155-157,179,4.基金项目
郑州市科技创新团队基金资助项目(10CXTD150) （10CXTD150）
