The Yenepoya Institute of Arts, Science, Commerce and Management (YIASCM)

Course: BCA(Big Data Analytics and Cloud Computing)-

Vr2

BCS504: Cryptography and Network Security

Unit-2:- Transformations , PART-6 Jamuna K M

Dept.of Computer Science, YIASCM

1
Objective
• Upon the completion of this session, the learner will be able to
 Understand the DES algorithm and its working
Understand the strength and weakness of DES algorithm
• Summary
• Reference
DES algorithm
• The Data Encryption Standard (DES) is a symmetric-key block cipher.
• created in the early 1970s by an IBM team and adopted by the
National Institute of Standards and Technology (NIST)
• In this 64 bit plain text converted to 64 bit cipher text, using
56 bit key.

64 bit plain text + 56 bit key -> 64 bit cipher text

• It is also known as DES or DEA( Data Encryption Algorithm)
 DES Algorithm Steps
• The algorithm process breaks down into the following steps
1. he process begins with the 64-bit plain text block getting handed over
to an initial permutation (IP) function.
2. The initial permutation (IP) is then performed on the plain text.
3. Next, the initial permutation (IP) creates two halves of the permuted
block, referred to as Left Plain Text (LPT) and Right Plain Text (RPT).
4. Each LPT and RPT goes through 16 rounds of the encryption process.
5. Finally, the LPT and RPT are rejoined, and a Final Permutation (FP) is
performed on the newly combined block.
6. The result of this process produces the desired 64-bit cipher text.
• The encryption process step (step 4, above) is further broken
down into five stages:
1. Key transformation
2. Expansion permutation
3. S-Box permutation
4. P-Box permutation
5. XOR and swap
 64 bit key

n= input, m= output Permutation

choice
56

Permutation Left circular

choice -1 shift

Permutation Left circular

choice -2 shift

Permutation Left circular

choice -16 shift

32 bit swap

Inverse initial • Expansion permutation

permutation • Straight permutation
• Compression
64 bit cipher text permutation
 Li-1 Ri-1 Ci-1 Di-1

Left shift Left shift

Expansion
Permutation
48
m= input n= output PC-
XOR
Straight permutation (m=n) 2
Expansion permutation 48
(m<n)
Compression permutation Substitution
(m>n) Permutation S-Box

Permutation

XOR Ci Di

Li Ri
Strength of DES
a. The use of 56-bit keys: 56-bit key is used in encryption, there are
256 possible keys. A brute force attack on such number of keys is
impractical.
b. The nature of algorithm: Cryptanalyst can perform cryptanalysis by
exploiting the characteristic of DES algorithm but no one has
succeeded in finding out the weakness.
Weakness of DES
a. Two chosen input to an S-box can create the same output.
b. The purpose of initial and final permutation is not clear.
Summary
• In this students understand about the
 DES algorithm and its working
Strength and weakness of DES
 References

• MichaelE.WhitmanandHerbertJ.Mattord.
(2012).PrinciplesofInformationSecurity,2ndEd.,T homson, CengageDelmarLearning.
• WilliamStalling.
(2012).NetworkSecurityEssentials:ApplicationsandStandards,4thEd.,Pear
sonEducation.
• BehrouzA.Forouzan,DebdeepMukhopadhyay.
(2011).CryptographyandNetworkSecur ity,2ndEd., SpecialIndianEdition,
TataMcGraw-Hill.