Professional Documents
Culture Documents
221 DCE InnovativeActivity
221 DCE InnovativeActivity
Topic
DES Algorithm
Case Study
INTRODUCTION:
KEY ISSUE:
To address issues in security & the threat posed to the DES algorithm by
brute force cracking, as well as the low efficiency of the 3DES algorithm, I
propose extending the length of the DES algorithm's key. First, change the
block length of the DES algorithm from 64 bits to 128 bits and expand the
key length of the DES algorithm to double length; secondly, iterative
encryption is performed according to the new plaintext grouping and the
expanded key length. The two groups are iteratively encrypted, and after
every single iteration the two sets of R part data obtained from this round of
encryption are exchanged, and then the next round of iteration; finally, the
improved DES algorithm is compared with the DES algorithm and the 3DES
algorithm by experiment. The results showing that the operating efficiency of
the improved DES algorithm is better than 3DES algorithm. Therefore, the
improved algorithm is proposed here greatly improves the security of the
algorithm under the premise of ensuring operating efficiency and has good
application value.
ANALYSIS OF CASE:
DES is a symmetric encryption algorithm. It has two inputs, plain texts and
keys. The length of the plaintext and the keys are both 64 bits, and 56 of
them are valid keys, and the remaining 8 bits are the parity bit[4]. The
following figure is flow of the schematic diagram of the DES algorithm.
Step1 Enter the plaintext into groups according to the 64bits packet length,
and then rearrange the 64bits data block P through the initial permutation
IP matrix.
Step3 The 16th round output has 64bits, which is a function of the input
plaintext and the key. It produces a 64bits data block as the result of this
The formula for the i-th round of encryption above process can be expressed
as:
LEiREi-1
REiLEi-1ͰF(REˈK)
About the implementation details of the DES algorithm and the change of
the f function:
Step2: XOR the R0 and the 48-bit subkey after the E-box expansion.
Step3: R0 after XOR operation with the sub items undergoes S-box
conversion. Step4: The R0 has undergone the S box transformation is
subjected to P box transformation.
The following figure shows sub-key generation process, the specific steps are
as follows :
Step1: The initial key of the DES algorithm has 64 bits, which is divided into
a matrix. Since the 8th bit of each row in the matrix is the check digit, the
8th bit of each row is discarded.
Step2 After discarding the check digit, the sub-key has 56 bits in total and
the 56-bit sub-key is replaced by selection 1, the result obtained is still 56
bits.
Step3 Divide the obtained 56-bits sub-keys into two groups with 28 bits of
each and move the two groups of subkeys to the left circular manner.
Step4: The shifted two sets of 28bits data are replaced by selection 2, each
group of 24bits data is filtered, and the two screening sets of data are
combined into 48bits as the subkey of the i-th round.
Figure 3 shows the main encryption process of the improved DES algorithm.
Step1 The length of the plaintext packet is changed from the original 64bits
to 128bits.
Step2 Divide the data of each group of 128 bits into the left group L and the
right group R, each group is 64 bits.
Step4 The two sets of data obtained after each iteration: the Ll part in the
left packet L and the Lr part in the right packet R are exchanged, and the
exchanged result is used as the input of the next iteration to continue
encryption. By analogy, the results of each iteration are exchanged.
ALGORITHM EFFICIENCY:
Algorithm efficiency refers to the execution time of the algorithm, and the
execution time of the algorithm needs to be measured by the time consumed
when the program compiled according to the algorithm runs on computers.
From the perspective of algorithm structure and theoretical analysis, the
execution efficiency of the improved DES algorithm proposed in this article
will be similar to DES algorithm itself. In the improved algorithm, although
the improved algorithm encryption requires two DES encryptions, the
improvement is the encryption algorithm reads a 128-bit data stream while
reading. Compared with DES reading a 64-bit data stream, the improved
encryption algorithm and the DES encryption algorithm are both perform
when encrypting the same block of plaintext. Encrypted once, so
theoretically, the improved encryption algorithm and the DES algorithm has
the same encryption efficiency.
CONCLUSION
The improved DES algorithm proposed here increases the security of the
algorithm from the three aspects of increasing the packet length, key length
and the exchange of each round of iterative results. The algorithm efficiency
is much higher than the 3DES algorithm, and the security is compared with
the original DES. The algorithm is still better. Therefore, the method
proposed here has nice application value. In the future research, further
research will be conducted on the efficiency of the algorithm to make a
better improve of algorithm.
REFERENCES
[1] Liu Haifeng, Cao Yumo, Liang Xingliang. Research on improved DES
based on stream cipher[J]. Computer Applications and Software, 2019,
36(09): 317-320.
[4] Yu Wei. Research on the key extension method and security of DES
algorithm [D]. Central China Normal University, 2019.
[6] Yu Wei. Research on the key extension method and security of DES
algorithm [D]. Central China Normal University, 2019
[7] Shruti Kumari, Gautam Kumar. Comparison of AES and DES Algorithm.
2015, 6(1):144-146.