密碼學加密算法分類_密碼學中的國際數據加密算法（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/