Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
9 views4 pages

Feistel Structure Numerical Example

The document discusses the Feistel structure and its numerical verification in the context of cryptography. It details the process of encrypting an 8-bit plaintext using a compression P-box, round keys, and S-box mappings. The final output demonstrates the transformation of plaintext into ciphertext and vice versa through the defined functions and operations.

Uploaded by

sodibodhi
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
0% found this document useful (0 votes)
9 views4 pages

Feistel Structure Numerical Example

The document discusses the Feistel structure and its numerical verification in the context of cryptography. It details the process of encrypting an 8-bit plaintext using a compression P-box, round keys, and S-box mappings. The final output demonstrates the transformation of plaintext into ciphertext and vice versa through the defined functions and operations.

Uploaded by

sodibodhi
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/ 4

Feistel Structure –

Numerical Verification
Dr. Renu Mary Daniel
Assistant Professor
Department of Cyber Security
IIIT, Kottayam
Compression P-Box
Defining the Dummy Round function 1 0 1 0
1 2 3 4

• Plaintext (8 bits) 4 1
• Left half - 4 bits, Right Half - 4 bits 0 1
• Round Keys – 2 bits
• Compression P-Box (maps 4-bit input to 2-bit output).
• S-box maps 2 bit input to 4 bit output.
4 bit PT Right half
0 1
5 6
0 Compression P-Box
7 8 (2 bits)
1

00 0101 XOR result with round key (2 bits)

2-bit to 4-bit conversion using S-Box


0101 (4 bits) 1011(4 bits)

01
F P-box(1011)  11
K1 = 01 11 01  10
S-box(10) 0111
K2 = 11 0111 0101  0010 S-Box

1011 0010

11
F P-box(0010)  00
00 11  11
S-box(11) 1000
1011 1000  0011

0010 0011

0011 0010 =Ciphertext!!!


0011 (4 bits) 0010(4 bits)

11
F P-box(0010)  00
K1 = 01 00 11  11
S-box(11) 1000
K2 = 11 1000 0011  1011 S-Box

0010 1011

01
F P-box(1011)  11
11 01  10
S-box(10) 0111
0111 0010  0101

1011 0101

0101 1011 = Original Plaintext!!!!

You might also like