论文部分内容阅读
描述了一种新的分组密码算法。该分组密码算法是按照Ｓｈａｎｎｏｎ所制定的保证密码算法安全性的扩散和混乱的原则来设计的。在本密码中，所需的扩散和混乱是通过在加密过程中混合三种互不相容的运算来达到的。在本密码算法中，明文和密文的分组大小为６４ｂｉｔ，密钥长１９２ｂｉｔ。本算法的核心是一个新的加密结构，称为加乘结构。在加密过程中，明文和子密钥被看成为有限域Ｆ（２６４）上的元素，并被加乘结构混合在一起。证明了该密码算法是一种Ｍａｒｋｏｖ密码算法且最大单圈差分概率为理论最小值，即１／（２６４－１）。因此它可有效地抵抗差分攻击的威胁。
A new block cipher algorithm is described. The block cipher algorithm is designed according to Shannon’s principle of guaranteeing the proliferation and confusion of the security of cryptographic algorithm. In this code, the proliferation and confusion required is achieved by mixing three incompatible operations in the encryption process. In this password algorithm, the packet size of plaintext and ciphertext is 64 bits, and the key length is 192 bits. The core of this algorithm is a new encryption structure called multiplicative structure. In the encryption process, the plaintext and sub-keys are treated as elements on the finite field F (264) and mixed together by the multiplication and multiplication structure. It is proved that the cryptographic algorithm is a Markov cryptographic algorithm and the maximum single-loop differential probability is the theoretical minimum, ie 1 / (264-1). So it can effectively resist the threat of differential attacks.