| 数据加密中的生长树复合模型 |
| |
| 引用本文： | 刘琦,吕述望,丁治国.数据加密中的生长树复合模型[J].中国科学院研究生院学报,2009,26(6):820-825. |
| |
| 作者姓名： | 刘琦 吕述望 丁治国 |
| |
| 作者单位： | 1. 中国科学技术大学电子科学与技术系,合肥,230027
2. 中国科学技术大学电子科学与技术系,合肥,230027;中国科学院研究生院信息安全国家重点实验室,北京,100080 |
| |
| 摘 要： | 在深入研究分组密码及其工作模式的基础上,引用正交空间的成熟理论,提出一种基于生长树的复合模型. 该模型对各经典分组密码算法加密后的密文进行复合,生成安全强度更高的输出序列. 理论分析和实验结果表明,该模型性能良好.
|
| 关 键 词： | 正交空间 生长树 换位算子 结构算子 |
| 收稿时间： | 2009-04-29 |
| 修稿时间： | 2009-05-22 |
Grow tree composite model in data encryption |
| |
| LIU Qi,L Shu-Wang,DING Zhi-Guo.Grow tree composite model in data encryption[J].Journal of the Graduate School of the Chinese Academy of Sciences,2009,26(6):820-825. |
| |
| Authors: | LIU Qi L Shu-Wang DING Zhi-Guo |
| |
| Institution: | 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 |
| |
| 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. |
| |
| Keywords: | orthogonal space grow tree transposition operator structure operator |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《中国科学院研究生院学报》浏览原始摘要信息 |
| 点击此处可从《中国科学院研究生院学报》下载免费的PDF全文 |
|
