A new modified DES algorithm based on the development of binary encryption functions

Abstract

One of the most commonly used symmetric encryption methods is the Data Encryption Standard (DES), but it has a number of flaws. For instance, the encryption method only employs two functions (XOR), acts on one bit, and only allows for a finite number of combinations of data. To solve these issues, a new modified DES algorithm is presented in this study. The typical encryption DES algorithm of 16 rounds has been extended in the key space and the plaintext (using multiple keys) by presenting a new operation (Xo) replace the present XOR operation to increase complexity. In contrast to DES, which only employs one key, the research approach uses three keys other than the standard DES one. The input key for encryption and decryption processes is the first key. while other three keys are used to determine the table numbers (2, 4, 6, 8, 10, and 12), which have values ranging from 0 to 4096. When compared to the famous DES and other modified algorithms, the complexity analysis of the suggested method reveals it is the most difficult. As a result, the attacker must make at least (4.7594738544661044544894020894748E+173) attempts to break the key and get the clear message. This indicates that the well-known DES security level will be raised by the suggested DES algorithm, depending on the new Xo function.

Keywords

• Feistel structure
• Information security encryption
• Des
• Multi-level keys
• Symmetric block cipher