期刊文献+

MUST1——一种快速分组加密算法 被引量:2

MUST1——A Quick Block Cryptography
下载PDF
导出
摘要 信息安全无论在军事上还是在商业应用上都十分重要 .美国的数据加密标准DES(DataEncryptionStandard)是迄今世界上最广泛使用和流行的一种分组密码算法 ,但由于密钥太短已面临淘汰 .本文中介绍一种分组密码———MUST1,它的明、密文都是12 8bit ,密钥长 2 5 6bit .同时从理论上证明了它的正确性 ,其抗攻击能力比DES更强 .测试结果表明 ,MUST1是高效的 ,它的加密速度是DES的 3倍 ,雪崩现象良好 .最后利用MUST1构造出HASH函数 ,同样具有抗攻击能力强、效率高的特点 . The information security is not only the concern of governments in the world,but also the private sector zealously guarded over their national cryptologic services.DES (Data Encryption Standard) has been widely used in many realms all over the world.However,it is close to the end of its life due to key length is too short.This paper is one of our researches:the block cipher--MUST1.Both the plaintext and ciphertext are 128 bit per block;the key legth is 256 bit.The validity has been proved in theory,and the unbreakable capability is much better than DES (the key length is 56 bits).From the result of the commissioning test,we observed that MUST1 is high effective,its encryption speed is 3 times faster than DES;the avalanche effect is excellent.At the same time,we designed a HASH function by adopting the construction of MUST1.The HASH function has the same characteristics as in MUST1.
出处 《华南理工大学学报(自然科学版)》 EI CAS CSCD 北大核心 2002年第7期32-34,48,共4页 Journal of South China University of Technology(Natural Science Edition)
基金 澳门发展与合作基金会资助项目
  • 相关文献

同被引文献19

  • 1Henry J B, Fred C P. Secure Speech Communications [M]. London: Harcourt Brace Jovanovich Publishers,1985.
  • 2Henk C A, van Tiborg. Fundamentals of Cryptology [M].Boston: Kluwer Academic Publishers ,2000.
  • 3Michael P. Secure Data Networking [M]. Boston: Artech House INC, 1993.
  • 4Man Y R. Cryptography and Secure Communications [M].Singapore: McGraw Hill Book Co, 1994.
  • 5卢开澄.计算机密码学[M].北京:清华大学出版社,1998..
  • 6Ding Cun-sheng,Xiao Guo-zhen,Shan Wei-juan.The stability theory of stream ciphers[M].Berlin-Heidelberg:Springer-Verlag,1991.
  • 7Klapper A,Goresky M.2-adic shift registers[M]∥Fast Software Encryption.Berlin-Heidelberg:Springer-Verlag,1994:174-178.
  • 8Klapper A,Goresky M.Feedback shift registers,2-adic span,and combiners with memory[J].J Cryptology,1997,10(2):111-147.
  • 9Klapper A.A survey of feedback with carry shift registers[M]∥Sequences and Their Applications-SETA 2004.Berlin-Heidelberg:Springer-Verlag,2005:56-71.
  • 10Arnault F,Berger T P,Necer A.Feedback with carry shift registers synthesis with the Euclidean algorithm[J].IEEE Trans on Information Theory,2004,50(5):910-917.

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部