Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 17

International Data Encryption

Algorithm (IDEA)
Reported by: LORENZO III P. MANALANG
International Data Encryption Algorithm (IDEA)

• It was developed by Xuejia Lai and James Massey.

• It is developed at ETH in Zurich Switzerland (Swiss Federal Institute of Technology) in


1990.

• The original version was called the “Proposed Encryption Standard (PES)”.

• 1992, International Data Encryption Algorithm – is a block cipher that uses a 128-bit key
to encrypt 64-bit data blocks.
International Data Encryption Algorithm (IDEA)

• Pretty Good Privacy (PGP) is based on the IDEA. - one of the popular e-mail privacy
technology

• IDEA uses both diffusion and confusion for encryption.

• Confusion is used for creating clueless ciphertext while diffusion is used for increasing
the redundancy of plaintext over the major part of the ciphertext to make it obscure.
BASIC IDEA ABOUT IDEA
• Plaintext is of 64-bit.
• Key is of 128-bit.
• From 128-bit original key the 52 subkeys are generated.
• Ciphertext is also same as plaintext in size that is of 64-bit.
• Number of identical rounds are 8 where in each round 6 keys are
used.
• 48 Keys are used in 8 rounds plus the last round (transformation)
used 4 keys. (48+4 = 52)
OPERATIONS TO BE USED
• There are several steps which includes
1. Multiplication
2. addition
3. XOR operations.

Addition and Multiplication is not simple addition and multiplication.


But it is…

Addition modulo 2^16


Multiplication modulo 2^16+1
Step 1: Multiply X1 and Z1 X1 X2 X3 X4

Step 2: Add X2 and Z2 Z1 Z3


Step 3: Add X3 and Z3 Z2 Z4
Step 4: Multiply X4 and Z4
Step 5: XOR the results of Step
1 and 3
Z5
Step 6: XOR the results of Step
2 and 4
Step 7: Multiply Step 5 and Z5 Z6

Step 8: Add Step 6 and Step 7


Step 9: Multiply Step 8 and Z6
Step 10: Add Step 7 and 9
Step 11: XOR Step 1 and 9
Y1 Y2 Y3 Y4
Step 12: XOR Step 3 and 9
EXAMPLE: IDEA ENCRYPTION
The 52 Subkeys are all generated from the 128-bit original key.

128-bit original key Z is given as


Z = 5a14 fb3e 021c 790e 6081 46a0 117b ff03
First 8 subkeys
52 16-bit subkeys

•After that, the key is circularly shifted 25 bits to


the left and again divided into eight 16-bits
subkeys.
EXPECTED OUTPUT AFTER ROUND 1:

ROUND 1:
Step 11 Step 12 Step 13 Step 14
C579 F2FF 0FBD 0FFC

ROUND 1: OUTPUT
x1 x2 x3 x4
C579 0FBD F2FF 0FFC
EXAMPLE: IDEA ENCRYPTION
128-bit original key Z is given as
Z = 5a14 fb3e 021c 790e 6081 46a0 117b ff03

64-bit plaintext X is given as


X = (X1, X2, X3, X4) = 7fa9 1c37 ffb3 df05

Answer: Cipher text


106b dbfd f323 0876
IDEA DECRYPTION
Is exactly the same as the encryption process, except that the sub-
blocks are reversed and a different selection of subkeys is used.

You might also like