Security Enhancement in Data Encryption Standard

Verma, Jatin; Prasad, Sunita

doi:10.1007/978-3-642-00405-6_34

Cited by 8 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of studies (Biryukov and Wagner, 2000;Zhuang et al, 2014;Biham and Biryukov;1995, Verma andPrasad, 2009;Sison et al, 2012;Kilian and Rogaway, 2001) have been proposed to improve the original DES against the attacks described above. Diffie and Hellman proposed triple DES (Biryukov and Wagner, 2000).…”

Section: Introductionmentioning

confidence: 99%

“…The limitation of this approach is the high probability of repeating the Sboxes arrangement in different rounds. Verma and Prasad (2009) proposed modifications to DES by first dividing the expanded right part of 48 bits into two parts each of 24 bits, then two different functions are applied to each of these two part. The key length was also increased to 112 bits by using tow keys.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Randomness Analysis of DES Ciphers Produced with Various Dynamic Arrangements

Qasaimeh¹,

Al‐Qassas²

2017

Journal of Computer Science

View full text Add to dashboard Cite

Abstract:Over the past few years, researchers have devoted efforts to enhance the original DES encryption algorithm. These enhancements focus on improving multiple perspectives of the algorithm through enhancing its internal components to deliver a robust DES variant against different kinds of typical attacks such as linear and differential crypto analysis, in addition to the newly evolved attacks such as differential power analysis attacks. In fact the output of existing solutions have enhanced the ciphertext randomness. This paper introduces two encryption algorithms that enhance the original DES named DDES and HDES. DDES is mainly based on a secure selection of both S-boxes and P-box arrangements during each encryption round, it has also extended the key length by adding two more keys beside the original one to the encryption process. HDES, on the other hand, uses a hash function to generate a random fingerprint for each plaintext block. This fingerprint is used to generate the seed to produce round seeds that are used to select secure S-boxes only for each round in the encryption process. These two variants meet with certain demands that are imposed by the user applications context. DDES provides a higher ciphertext randomness with some added processing time, while HDES provides a relatively secure variant with lower processing time. These two variants can provide alternatives depending on the targeted applications that require different levels of security and processing time. DDES and HDES have been evaluated and compared against DES, DESX and 3DES, using a number of metrics including chi-square test, cipher data difference, hamming distance and processing time.

show abstract