密码学加密算法分类_密码学中的国际数据加密算法（IDEA）

密码学加密算法分类

Introduction

介绍

International Data Encryption Algorithm (IDEA) is a type of cryptography as a block cipher algorithm designed by "Xuejia Lai" and "James L.Massey" of ETH-Zürich and was first published in the 1991 year. Then, the original algorithm went through a few modifications and finally named as International Data Encryption Algorithm (IDEA) as follows. The mentioned algorithm works on 64-bit plain text and cipher text block at one time in the algorithm. Then, For encryption, the 64-bit plain text is divided into four 16 bits sub-blocks of the algorithm. In our discussion, we denote these four blocks as P1 (16 bits), P2 (16 bits), P3 (16 bits) and P4 (16 bits) as the divide of 4 blocks. Here, each of these blocks goes through 8 ROUNDS and one OUTPUT TRANSFORMATION phase at the end of the operation. In each of these eight rounds, some as arithmetic and logical operations are performed by this algorithm. Therefore, the eight ROUNDS are the same sequences of operations are repeated after every round in the cryptography.International Data Encryption Algorithm (IDEA) is a type of cryptography as a block cipher algorithm designed by "Xuejia Lai" and "James L.Massey" of ETH-Zürich and was first published in the 1991 year. Then, the original algorithm went through a few modifications and finally named as International Data Encryption Algorithm (IDEA) as follows. The mentioned algorithm works on 64-bit plain text and cipher text block at one time in the algorithm. Then, For encryption, the 64-bit plain text is divided into four 16 bits sub-blocks of the algorithm. In our discussion, we denote these four blocks as P1 (16 bits), P2 (16 bits), P3 (16 bits) and P4 (16 bits) as the divide of 4 blocks. Here, each of these blocks goes through 8 ROUNDS and one OUTPUT TRANSFORMATION phase at the end of the operation. In each of these eight rounds, some as arithmetic and logical operations are performed by this algorithm. Therefore, the eight ROUNDS are the same sequences of operations are repeated after every round in the cryptography.

国际数据加密算法(IDEA)是一种加密技术，它是由ETH-Zürich的“ Xuejia Lai”和“ James L.Massey”设计的一种分组密码算法，于1991年首次发布。然后，对原始算法进行了一些修改，最终将其命名为国际数据加密算法(IDEA)，如下所示。提到的算法在该算法中一次可处理64位纯文本和密文块。然后，为了进行加密，将64位纯文本分为该算法的四个16位子块。在我们的讨论中，我们将这四个块表示为P1(16位)，P2(16位)，P3(16位)和P4(16位)作为4个块的划分。在此，每个块在操作结束时都要经过8个回合和一个输出转换阶段。在这八个回合的每个回合中，此算法都会执行一些算术和逻辑运算。因此，在密码学中的每个回合之后，八个ROUNDS都是相同的操作序列。国际数据加密算法(IDEA)是一种密码学，它是由“学家来”和“詹姆斯·马塞(James L.Massey)”设计的分组密码算法。于1991年首次出版。然后，对原始算法进行了一些修改，最终将其命名为国际数据加密算法(IDEA)，如下所示。提到的算法在该算法中一次可处理64位纯文本和密文块。然后，为了进行加密，将64位纯文本分为该算法的四个16位子块。在我们的讨论中，我们将这四个块表示为P1(16位)，P2(16位)，P3(16位)和P4(16位)作为4个块的划分。在此，每个块在操作结束时都要经过8个回合和一个输出转换阶段。在这八个回合的每个回合中，此算法都会执行一些算术和逻辑运算。因此，在密码学中的每一轮之后，八个ROUNDS是相同的操作序列。

At the last phase, i.e., the OUTPUT TRANSFORMATION phase, we perform only arithmetic operations with 4 keys in the cryptography. International Data Encryption Algorithm (IDEA) is a type of cryptography as a block cipher algorithm designed by "Xuejia Lai" and "James L.Massey" of ETH-Zürich and was first published in the 1991 year. Then, the original algorithm went through a few modifications and finally named as International Data Encryption Algorithm (IDEA) as follows. The mentioned algorithm works on 64-bit plain text and cipher text block at one time in the algorithm. Then, For encryption, the 64-bit plain text is divided into four 16 bits sub-blocks of the algorithm. In our discussion, we denote these four blocks as P1 (16 bits), P2 (16 bits), P3 (16 bits) and P4 (16 bits) as the divide of 4 blocks. Here, each of these blocks goes through 8 ROUNDS and one OUTPUT TRANSFORMATION phase at the end of the operation. In each of these eight rounds, some as arithmetic and logical operations are performed by this algorithm. Therefore, the eight ROUNDS are the same sequences of operations are repeated after every round in the cryptography. At the last phase, i.e., the OUTPUT TRANSFORMATION phase, we perform only arithmetic operations with 4 keys in the cryptography.

在最后一个阶段，即输出转换阶段，我们仅使用密码学中的4个密钥执行算术运算。国际数据加密算法(IDEA)是一种加密技术，它是由ETH-Zürich的“ Xuejia Lai”和“ James L.Massey”设计的一种分组密码算法，于1991年首次发布。然后，对原始算法进行了一些修改，最终将其命名为国际数据加密算法(IDEA)，如下所示。提到的算法在该算法中一次可处理64位纯文本和密文块。然后，为了进行加密，将64位纯文本分为该算法的四个16位子块。在我们的讨论中，我们将这四个块表示为P1(16位)，P2(16位)，P3(16位)和P4(16位)作为4个块的划分。在此，每个块在操作结束时都要经过8个回合和一个输出转换阶段。在这八个回合的每个回合中，此算法都会执行一些算术和逻辑运算。因此，在密码学中的每一轮之后，八个ROUNDS是相同的操作序列。在最后一个阶段，即输出转换阶段，我们仅使用密码学中的4个密钥执行算术运算。

It is an IDEA, unlike the other block cipher algorithms is studied by the Swiss firm of Ascom. However, be unique in permit with permission with free noncommercial use of their algorithm which the result that IDEA is best known as the block cipher algorithm used within the popular encryption for the message character.The algorithm is suggested in its own right. It has some steps which make it appear that it might be a non-invertible hash function instead of a block cipher in the cryptography. Also, it is told in that it entirely ignores the use of any S-boxes or given lookup table in the cryptography.

它是一种IDEA，与瑞士Ascom公司研究的其他分组密码算法不同。但是，在允许自由使用非商业用途的算法的情况下，在许可方面是唯一的，其结果是IDEA最广为人知的消息字符流行加密中使用的分组密码算法。它具有一些步骤，使其看起来可能是不可逆的哈希函数，而不是密码术中的分组密码。而且，据告知，它完全忽略了密码术中对任何S盒或给定查询表的使用。

Here, IDEA uses 52 subkeys and every 16 bits long of character. Here, two are used during each round in the IDEA proper and four are used before every round and after the last round. It has eight rounds and at last output round which includes 4 keys.The original text or plaintext block in IDEA is divided into four blocks and each 16 bits long. Mainly, three operations are used in IDEA to combine two 16 bit values to produce a 16-bit result as ciphertext as addition, XOR, and multiplication. Here, Addition is normal addition with carries the modulo 65,536. Multiplication, as used in IDEA, requires some need for explanation.

在这里，IDEA使用52个子项，每16位字符长。这里，在IDEA适当的每一轮中使用了两个，在每一轮之前和最后一轮之后使用了四个。它有8个回合，最后一个输出回合包含4个键.IDEA中的原始文本或纯文本块分为四个块，每个块长16位。在IDEA中，主要使用三个运算来组合两个16位值以产生一个16位结果，作为密文的加法，XOR和乘法。在此，加法是正常的加法运算，带有65,536的模。 IDEA中使用的乘法需要一些解释。

Now, Multiplication by zero always produces zero and is not invertible in the message. Multiplication modulo n is also not invertible whenever it is by a number that is not relatively prime to n like this. The main single way multiplication is used in IDEA, it must be always invertible in the message form in the cryptography.

现在，乘以零总是产生零，并且在消息中不可逆。乘模n每次也不是不可逆的，就不能像这样对n进行质数运算。在IDEA中使用主要的单向乘法，它必须始终以密码形式的消息形式可逆。

IDEA的框图 (Block Diagram of IDEA)

The plaintext of 64-bit input block-divided into 4 part (16 bits each) Declare p1 to p4:

将64位输入块的明文分为4部分(每个16位)声明p1至p4：

Therefore, from plaintext p1 to p4 will be the inputs for the initial round of the algorithm in this.
因此，从明文p1到p4将是此算法的初始回合的输入。
Here, are 8 such rounds.
这是8个这样的回合。
Then, the key is made up of 128 bits.
然后，密钥由128位组成。
In every round, 6 sub-keys will be produced by key generation.
在每个回合中，将通过密钥生成来产生6个子密钥。
Each one of the sub-keys includes 16 bits of character.
每个子键都包含16位字符。
All these sub-keys will be put on the 4 input blocks p1 to p4 in the operation.
在操作中，所有这些子键都将放置在4个输入块p1至p4上。
There will be last actions include Output Transformation which usually benefits simply 4 sub-Keys at the last key generation.
最后会有动作，包括输出转换，通常在最后一个密钥生成时仅受益于4个子密钥。
The last output created is 4 blocks of ciphertext C1 to C4 as each one of 16 bits and combine them to make a ciphertext.
创建的最后一个输出是密文C1至C4的4个块，分别为16位，并将它们组合在一起以形成密文。
They are mixed to create the last 64-bit ciphertext block by this operation.
通过此操作将它们混合在一起以创建最后的64位密文块。

加密步骤 (Steps of Encryption Process)

输出转换 (Output Transformation)

It can be done a one-time procedure.
可以完成一次性过程。
They require places by the end of the 8th round in the operation.
他们需要在行动的第8轮结束时获得位置。
Here, the input towards the Output transformation is, a 64-bit value divided into 4 sub-blocks (state R1 to R4 every among 16 bits) from the message.
此处，输出转换的输入是一个64位的值，该值从消息分为4个子块(状态位R1至R4，每16位)。
The cryptography bit of four 16 bits Sub-keys (K1 to K4) is used here.
这里使用四个16位子密钥(K1至K4)的加密位。
Now, the process of the outcome transformation can be as follows until now.
到目前为止，结果转换的过程可以如下。

解密 (Decryption)

The Decryption implements like encryption, but the order of the round keys is generated, and the subkeys for the odd rounds are inversed into this. Therefore, the values of subkeys K1-K4 are replaced by the inverse of K49-K52 for the respective group operation in the cryptography, K5, and K6 of each group should be replaced by K47 and K48 for decryption in this operation in the cryptography.

解密的实现与加密类似，但是生成了回合密钥的顺序，并且奇数回合的子密钥也与此相反。因此，对于密码学中的各个组操作，将子密钥K1-K4的值替换为K49-K52的倒数；对于密码学中的该操作，每个组的K5和K6应由K47和K48进行解密。

安全 (Security)

The implemented analyzed IDEA to measure its strength against differential cryptoanalysis and concluded that it is immune under certain assumptions in this. No successful linear or algebraic weaknesses have been reported for this view. In fact of 2007, the best attack applied to all keys could break IDEA reduced to 6 rounds as the full IDEA cipher uses 8.5 rounds as having output transformation in last having 4 keys. Required, that a "break" is an attack that requires less than 2128 operations into this algorithm; the 6-round attack requires 264 known plaintexts or original text and 2126.8 operations for the algorithm in the cryptography.The implemented analyzed IDEA to measure its strength against differential cryptoanalysis and concluded that it is immune under certain assumptions in this. No successful linear or algebraic weaknesses have been reported for this view. In fact of 2007, the best attack applied to all keys could break IDEA reduced to 6 rounds as the full IDEA cipher uses 8.5 rounds as having output transformation in last having 4 keys. Required, that a "break" is an attack that requires less than 2128 operations into this algorithm; the 6-round attack requires 264 known plaintexts or original text and 2126.8 operations for the algorithm in the cryptography.

已执行的已分析IDEA可以衡量其抵抗差分密码分析的强度，并得出结论认为在某些假设下它是不受干扰的。对于这种观点，没有成功的线性或代数弱点的报道。实际上，在2007年，应用于所有密钥的最佳攻击可能会将IDEA减少到6轮，因为完整的IDEA密码使用8.5轮作为最后具有4个密钥的输出转换。要求“突破”是一种要求对该算法进行少于2128次操作的攻击。 6轮攻击需要264个已知的纯文本或原始文本以及2126.8个密码算法进行运算。实施的分析IDEA可以衡量其抵抗差分密码分析的强度，并得出结论认为在某些假设下它是免疫的。对于这种观点，没有成功的线性或代数弱点的报道。实际上，在2007年，应用于所有密钥的最佳攻击可能会将IDEA减少到6轮，因为完整的IDEA密码使用8.5轮作为最后具有4个密钥的输出转换。要求“突破”是一种要求对该算法进行少于2128次操作的攻击。 6轮攻击需要264个已知的纯文本或原始文本以及2126.8个密码算法的运算。

The Bruce Schneier thought highly of IDEA in 1996, writing as follows: "According to my opinion, it is the best and most secure block algorithm available to the public at this time for the algorithm." Wherever, by 1999 he was no longer recommending IDEA due to the availability of faster algorithms, some progress in its cryptanalysis, and the issue of patents in the cryptography cryptoanalysis.Since in 2011 the full 8.5-round of IDEA was break using a meet-in-the-middle attack by this algorithm. In fact, in 2012, full 8.5-round IDEA was broken using a narrow-bicliques attack, with a reduction of cryptographic strength of about 2 bits of the character, similar to the effect of the previous bicliques attack on AES; however, this attack does not threaten the security of IDEA in practice in the algorithm of cryptography.

布鲁斯·施耐尔(Bruce Schneier)在1996年对IDEA给予了高度评价，他写道：“根据我的观点，这是目前公众可以使用的最好，最安全的块算法。” 无论何时何地，由于速度更快的算法的可用性，其密码分析的某些进展以及密码学密码分析的专利问题，到1999年，他不再推荐IDEA。自2011年以来，IDEA的8.5轮全面比赛被打破，此算法的中间攻击。实际上，在2012年，完整的8.5轮IDEA使用了窄双斜方攻击而被破坏，使字符的加密强度降低了约2位，类似于先前对AES的双斜攻击的影响。但是，这种攻击实际上不会在加密算法中威胁到IDEA的安全性。

It will very secure and safe to implement or encrypt or decrypt by this algorithm IDEA.

通过此算法IDEA实施，加密或解密将非常安全。

Image source: https://www.educba.com/idea-algorithm/

图片来源： https : //www.educba.com/idea-algorithm/