Professional Documents
Culture Documents
(Polytechnic)
Submitted by:
Name of Student :- Nagesh Jaybhaye
SEMESTER-6
2023-24
CERTIFICATE
This is to certify that Mr. Nagesh Jaybhaye has submitted Project report entitled "Write a
program to implement the DES algorithm" is submitted in the partial fulfillment of
requirement for the award of the Diploma in Computer Engineering by Maharashtra
State Board of Technical Education as record of students' own work carried out by
them under the guidance and supervision at Ajeenkya DY Patil School Of Engineering
(Charholi), during the academic year 2023-24.
1. Brief Introduction 5
3. Action Plan 6
4. Resources Required 7
5. Co Integrated 7
6. Figure Table 7
7. DES Algorithm 8
8. Source Code 11
1. Brief Introduction:
The Data Encryption Standard (DES) was a widely used symmetric-key algorithm for
encrypting digital data. It was developed in the 1970s and adopted as a federal standard in the
United States. DES played a significant role in the development of modern cryptography, but its
short key length (56 bits) makes it insecure for contemporary applications.
3. Collecting information
4. Making proposal
Nagesh Jaybhaye
6. Preparation of
final project
report
2. OS Windows 12
7. Figure Table
DES Algorithm
Data Encryption Standard (DES) is a block cipher with a 56-bit key length that has played a
significant role in data security. Data encryption standard (DES) has been found vulnerable to very powerful
attacks therefore, the popularity of DES has been found slightly on the decline. DES is a block cipher and
encrypts data in blocks of size of 64 bits each, which means 64 bits of plain text go as the input to DES,
which produces 64 bits of ciphertext. The same algorithm and key are used for encryption and decryption,
with minor differences. The key length is 56 bits.
Thus, the discarding of every 8 th bit of the key produces a 56-bit key from the original 64-bit key.
DES is based on the two fundamental attributes of cryptography: substitution (also called confusion) and
transposition (also called diffusion). DES consists of 16 steps, each of which is called a round. Each round
performs the steps of substitution and transposition. Let us now discuss the broad-level steps in DES.
In the first step, the 64-bit plain text block is handed over to an initial Permutation (IP) function.
The initial permutation is performed on plain text.
Next, the initial permutation (IP) produces two halves of the permuted block; saying Left Plain
Text (LPT) and Right Plain Text (RPT).
Now each LPT and RPT go through 16 rounds of the encryption process.
In the end, LPT and RPT are rejoined and a Final Permutation (FP) is performed on the
combined block
The result of this process produces 64-bit ciphertext.
Initial Permutation (IP)
As we have noted, the initial permutation (IP) happens only once and it happens before the first round. It
suggests how the transposition in IP should proceed, as shown in the figure. For example, it says that the IP
replaces the first bit of the original plain text block with the 58 th bit of the original plain text, the second bit
with the 50th bit of the original plain text block, and so on.
This is nothing but jugglery of bit positions of the original plain text block. The same rule applies to all the
other bit positions shown in the figure.
As we have noted after IP is done, the resulting 64-bit permuted text block is divided into two half blocks.
Each half-block consists of 32 bits, and each of the 16 rounds, in turn, consists of the broad-level steps
outlined in the figure.
Fig:- IP chart
Step 1: Key transformation
We have noted initial 64-bit key is transformed into a 56-bit key by discarding every 8 th bit of the
initial key. Thus, for each a 56-bit key is available. From this 56-bit key, a different 48-bit Sub Key is
generated during each round using a process called key transformation. For this, the 56-bit key is
divided into two halves, each of 28 bits. These halves are circularly shifted left by one or two positions,
depending on the round.
For example: if the round numbers 1, 2, 9, or 16 the shift is done by only one position for other
rounds, the circular shift is done by two positions. The number of key bits shifted per round is shown in
the figure.
After an appropriate shift, 48 of the 56 bits are selected. From the 48 we might obtain 64 or
56 bits based on requirement which helps us to recognize that this model is very versatile and can
handle any range of requirements needed or provided. For selecting 48 of the 56 bits the table is
shown in the figure given below. For instance, after the shift, bit number 14 moves to the first
position, bit number 17 moves to the second position, and so on. If we observe the table , we will
realize that it contains only 48-bit positions. Bit number 18 is discarded (we will not find it in the
table), like 7 others, to reduce a 56-bit key to a 48-bit key. Since the key transformation process
involves permutation as well as a selection of a 48-bit subset of the original 56-bit key it is called
Compression Permutation.
Because of this compression permutation technique, a different subset of key bits is used in
each round. That makes DES not easy to crack.
Recall that after the initial permutation, we had two 32-bit plain text areas called Left Plain
Text(LPT) and Right Plain Text(RPT). During the expansion permutation, the RPT is expanded from 32
bits to 48 bits. Bits are permuted as well hence called expansion permutation. This happens as the 32-bit
RPT is divided into 8 blocks, with each block consisting of 4 bits. Then, each 4-bit block of the previous
step is then expanded to a corresponding 6-bit block, i.e., per 4-bit block, 2 more bits are added.
This process results in expansion as well as a permutation of the input bit while creating output. The key
transformation process compresses the 56-bit key to 48 bits. Then the expansion permutation process
expands the 32-bit RPT to 48-bits. Now the 48-bit key is XOR with 48-bit RPT and the resulting output is
given to the next step, which is the S-Box substitution.
Source Code
Advantages & Disadvantages
Advantages
DES has been around a long time (since 1977), even no actual weaknesses have been discovered
and the most effective attack is still brute force.
DES is an official United States Government standard. The Government is needed to re-certify,
DES every five years and ask it be restored if essential.
DES is also an ANSI and ISO standard. Because DES was designed to run on 1977 hardware, it is
rapid in hardware and associatively quick in software.
It supports functionality to save a file in an encrypted format which can only be accessed by
supporting the correct password.
It can change the system to create the directories password protected.
It can review a short history of DES and represent the basic structures.
It can define the building block component of DES.
Disadvantages
The 56 bit key size is the largest defect of DES and the chips to implement one million of DES
encrypt or decrypt operations a second are applicable (in 1993).
Hardware implementations of DES are very quick.
DES was not designed for application and therefore it runs relatively slowly.
In a new technology, it is improving a several possibility to divide the encrypted code, therefore
AES is preferred than DES.
9. Skill Development:
Understand the logic behind DES algorithm
Understand the concept of encrypt and decrypt.
Understand the concept of cryptography.
10.Reference:
1. www.javatpoint.com
2. www.geeksforgeeks.org
3. https://www.tutorialspoint.com/
4. https://www.simplilearn.com/
11. Conclusion:
In conclusion, the Data Encryption Standard (DES) is a block cipher with a 56-
bit key length that has played a significant role in data security. However, due to
vulnerabilities, its popularity has declined. DES operates through a series of rounds
involving key transformation, expansion permutation, and substitution, ultimately
producing ciphertext from plaintext. While DES has historical significance, it’s
crucial to consider more secure encryption alternatives for modern data protection
needs.