Scribd
Upload
576 views34 pages

Idea

The document discusses symmetric encryption algorithms IDEA and DES. It provides details on: 1) IDEA - Its block size of 64 bits, 128-bit key size, use of confusion and diffusion principles, subdivision of blocks and generation of 52 subkeys from the 128-bit key for encryption. 2) DES - Its block size of 64 bits and key size of 64 bits. It has initial and final permutations, and 16 complex iteration rounds that use different subkeys derived from the original key. 3) Encryption process involving subkey generation, addition, multiplication and XOR operations for IDEA and DES function details for DES including expansion permutation, S-boxes and straight permutation.

Uploaded by

sukla.banerjee6427
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
576 views34 pages

Idea

The document discusses symmetric encryption algorithms IDEA and DES. It provides details on: 1) IDEA - Its block size of 64 bits, 128-bit key size, use of confusion and diffusion principles, subdivision of blocks and generation of 52 subkeys from the 128-bit key for encryption. 2) DES - Its block size of 64 bits and key size of 64 bits. It has initial and final permutations, and 16 complex iteration rounds that use different subkeys derived from the original key. 3) Encryption process involving subkey generation, addition, multiplication and XOR operations for IDEA and DES function details for DES including expansion permutation, S-boxes and straight permutation.

Uploaded by

sukla.banerjee6427
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 34

Cryptography and Network Security

PEC CS-801B
Ms. Sukla Banerjee
Asst. Professor, Dept. of CSE
RCCIIT
IDEA
International Data Encryption Algorithm

The international Data Encryption Algorithm (IDEA) is a symmetric


encryption algorithm. This symmetric block cipher was developed
by Xuejia Lai and James Massey in 1990.
Design Principles


Block size- 64 bit, strong enough to deter statistical analysis.

Key size-128 bit, long enough to prevent exhaustive key
searches

Confusion: The ciphertext should depend on the plaintext and
key in such a way that the determination of how the statistics of
the ciphertext depend on the statistics of the plaintext becomes
complex.

Diffusion: Each plaintext bit and each key bit should influence
every ciphertext bit so that the spreading of a single plaintext bit
over many ciphertext bits hides the statistical structure of the
plaintext.

Each 64 bit block is divided into four(4)
16 bit sub-block as input.


128 bit key is used to generate 52
subkeys each of length 16 bit.


8 intermidate round each uses 6
subkeys resulting in use of total 48
subkeys out of 52 subkeys.


Final output transformation round uses
4 subkeys.
16bit
16bit
Subkey generation
Subkey generation

128 bit is key is divided into first eight (8) subkeys each of size 16 bit i.e
first eight bit of 128 bit key is taken as subkey one and so on and all
subkeys are labeled here Z1, Z2, Z3, Z4, Z5, Z6, Z7, Z8 respectively.


Round 1 uses subkeys Z1-Z6.


Then a circular left shift of 25 bit positions is applied to the 128 bit Key and
the next eight subkeys are extracted as described before and labeled as
Z9-Z16.


Round 2 uses Z7, Z8,Z9-Z12.


Then again a circular left shift of 25 bit positions is applied to the
previously generated 128bit Key and the next eight subkeys are extracted
and labeled as Z17-Z25.


Round 3 uses Z13-Z16, Z17,Z18.


This process continues until all 52 sub keys are generated.
Operations used in IDEA


Bit-by-bit exclusive-OR operation and is denoted as


Modified Addition Operation: Addition of integers modulo
216 (modulo 65536), with inputs and outputs treated as
unsigned 16-bit integers. This operation is denoted as


Modified Multiplication Operation: Multiplication of
integers modulo 216+1 (modulo 65537), with inputs and
outputs treated as unsigned 16-bit integers, except that a
block of all zeros is treated as representing 216. This
operation is denoted as
Modified Addition Operation

The result of addition of two 16 bit should be 16 bit here, but addition
operation may results a carry. Throwing away carry is equivalent to
mod 216.

Modified Multiplication Operation

The result of multiplying two 16 bit will be 32 bit. To make it 16 bit the 32
bit result is divided by 216 +1 and then the reminder is taken.
IDEA encryption-Operations on each
round

In IDEA diffusion is provided by the basic building block of the


algorithm, known as the multiplication/addition (MA) structure.
Subsequent rounds have the same structure but with different
subkey and plaintext-derived inputs. The round begins with a
transformation that combines the four input subblocks with four
subkeys, using the addition and multiplication operations.

The MA structure also takes two subkeys as input and combines


these inputs to produce two 16- bit outputs.

Finally, the four output blocks from the upper transformation are
combined with two output blocks of the MA structure using XOR to
produce the four output blocks for this round.
Transformation
S1=step1

P1=plain text
(i.e x1 in the
previous slide
block diagram)

K1=subkey1
(i.e Z1 in the
previous slide
block diagram)
Final round-Output Transformation
DES
Data Encryption Standard (DES)

One example of a complex block cipher is the Data Encryption


Standard (DES). DES was designed by IBM and adopted by the U.S.
government as the standard encryption method for nonmilitary and
nonclassified use. The algorithm encrypts a 64-bit plaintext block
using a 64-bit key.

DES has two transposition blocks (P-boxes) and 16 complex round


ciphers (they are repeated). Although the 16 iteration round ciphers
are conceptually the same, each uses a different key derived from
the original key.

The initial and final permutations are keyless straight permutations


that are the inverse of each other. The permutation takes a 64-bit
input and permutes them according to predefined values.
Figure 10 DES
Figure 11 One round in DES ciphers
DES function

DES Function The heart of DES is the DES


function. The DES function applies a 48-bit key
to the rightmost 32 bits Ri to produce a 32-bit
output. This function is made up of four
operations: an XOR, an expansion permutation,
a group of S-boxes, and a straight permutation.
Figure 12 DES function
Example is this 6×4-bit S-Box from DES (S5)

Given a 6-bit input, the 4-bit output is found by selecting the row
using the outer two bits (the first and last bits), and the column using
the inner four bits. For example, an input "011011" has outer bits "01"
and inner bits "1101"; the corresponding output would be "1001".

You might also like