摘要
描述了一种新的分组密码算法。该分组密码算法是按照Ｓｈａｎｎｏｎ所制定的保证密码算法安全性的扩散和混乱的原则来设计的。在本密码中，所需的扩散和混乱是通过在加密过程中混合三种互不相容的运算来达到的。在本密码算法中，明文和密文的分组大小为６４ｂｉｔ，密钥长１９２ｂｉｔ。本算法的核心是一个新的加密结构，称为加乘结构。在加密过程中，明文和子密钥被看成为有限域Ｆ（２６４）上的元素，并被加乘结构混合在一起。证明了该密码算法是一种Ｍａｒｋｏｖ密码算法且最大单圈差分概率为理论最小值，即１／（２６４－１）。因此它可有效地抵抗差分攻击的威胁。
This paper describes a new block encryption algorithm. This block cipher is designed in accordance with Shannon's principles of confusion and diffusion for obtaining security in secret key cipher. By mixing three incompatible operations, the confussion and diffusion are achieved in this cipher. In this block encryption algorithm, the block length is 64 bit for plaintext and ciphertext; the user selected key is 192 bit in length. The kernel part of this cipher is a new cryptographic structure called addition multiplication structure. In the encipher processing, the planitext and subkey are looked upon as two elements in the Galois Field F (2 64 ), and then mixed by the additive and multiplicative operation in F (2 64 ). It is proved that this secret key block enciphering algorithm is a Markov cipher and its maximum probability of 1 round differential is theoretic minimum, i.e., 1/(2 64 -1), so it can resist differential cryptanalysis with a few rounds.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1998年第S1期55-59,共5页
Journal of Tsinghua University(Science and Technology)
关键词
分组密码
对称密码
差分攻击
block cipher
symmetrical cipher
differential cryptanalysis
