收稿日期: 2009-04-29
修回日期: 2009-05-22
网络出版日期: 2009-11-15
Grow tree composite model in data encryption
Received date: 2009-04-29
Revised date: 2009-05-22
Online published: 2009-11-15
刘琦 , 吕述望 , 丁治国 . 数据加密中的生长树复合模型[J]. 中国科学院大学学报, 2009 , 26(6) : 820 -825 . DOI: 10.7523/j.issn.2095-6134.2009.6.013
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
[1] Menezes A J, van Oorschot P, Vanstone S. Handbook of applied cryptography
[M]. London:CRC Press, 1997.
[2] National Bureau of Standards 1980, DES Modes of Operation
[S].
[3] Diffie W, Hellman M, Privacy, et al. An introduction to cryptography //Proceedings of the IEEE, 1979, 67(3): 397-427.
[4] Rogaway P. OCB mode: parallelizable authenticated encryption . ACM Transactions on Information and System Security, 2003, 6(3): 365-403.
[5] Gligor V, Donescu P. Fast encryption and authentication //XCBC Encryption and XECB Authentication Modes, FSE 2001, LNCS. Springer-Verlag, 2001: 92-108.
[6] Jutla C. Encryption modes with almost free message integrity //Advances in Cryptology-Eurocrypt01, LNCS. Berlin: Springer-Verlag, 2001,2045: 529-544.
[7] Bellare M, Rogaway P, Wagner D. The EAX mode of operation //FSE 2004, LNCS. Spriger-Verlag, 2004: 389-407.
[8] Serge Vaudenay. A theory for block cipher security
[J]. Journal of Cryptology, 2003, 16: 249-286.
[9] 周美珂. 泛函分析
[M]. 北京:北京师范大学出版社, 2007: 103-116.
/
| 〈 |
|
〉 |
