欢迎访问中国科学院大学学报,今天是

中国科学院大学学报 ›› 2009, Vol. 26 ›› Issue (6): 820-825.DOI: 10.7523/j.issn.2095-6134.2009.6.013

• 论文 • 上一篇    下一篇

数据加密中的生长树复合模型

刘琦1, 吕述望1,2, 丁治国1   

  1. 1. 中国科学技术大学电子科学与技术系,合肥 23002
    2. 中国科学院研究生院信息安全国家重点实验室,北京 100080
  • 收稿日期:2009-04-29 修回日期:2009-05-22 发布日期:2009-11-15
  • 通讯作者: 吕述望

Grow tree composite model in data encryption

LIU Qi1, Lü Shu-Wang1,2, DING Zhi-Guo1   

  1. 1. Department of Electronic Science and Technology, University of Science and Technology of China, Hefei 230027, China;
    2. State Key Laboratory of Information Security, Graduate University, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2009-04-29 Revised:2009-05-22 Published:2009-11-15

摘要:

在深入研究分组密码及其工作模式的基础上,引用正交空间的成熟理论,提出一种基于生长树的复合模型. 该模型对各经典分组密码算法加密后的密文进行复合,生成安全强度更高的输出序列. 理论分析和实验结果表明,该模型性能良好.

关键词: 正交空间, 生长树, 换位算子, 结构算子

Abstract:

On the basis of our study on block cipher and its operation mode, a novel grow tree composite model was proposed using the theory in orthogonal space. All the classical block cipher algorithms can be composed into a new output sequence with high security and low computation complexity. The experimental result and theoretical analysis show the excellent performance of this model.

Key words: orthogonal space, grow tree, transposition operator, structure operator

中图分类号: