Data encryption standard (DES) is a symmetric key block cipher algorithm. The algorithm is based on Feistel network. The algorithm uses a 56-bit key to encrypt data in 64-bit blocks.
There are mainly two categories of concerns about the strength of Data encryption standard. They are:
- Concerns about the particular algorithm used.
- Concerns about the usage of key of size 56-bit.
The first concern regarding the algorithm used addresses the possibility of cryptanalysis by making use of the DES algorithm characteristics. A more severe concern is about the length of secret key used. There can be (approximately 7.2 × keys) possible keys with a key length of 56 bits. Thus, a brute force attack appears to be impractical.
Assuming that on an average one has to search half the key space, to break the cipher text, a system performing one DES encryption per microsecond might require more than thousand years. But, the assumption of one DES encryption per microsecond is too conservative. In July 1998, DES was finally proved to be insecure when the Electronic Frontier Foundation (EFF) had broken a DES encryption. The encryption was broken with the help of a special-purpose “DES cracker” machine. It was reported that the attack took less than 3 days.
Simply running through all possible keys won’t result in cracking the DES encryption. Unless known plain text is given, the attacker must be able to differentiate the plain text from other data. Some degree of knowledge about the target plain text and some techniques for automatically distinguishing plain text from garble are required to supplement the brute-force approach. If brute force attack is the only means to crack the DES encryption algorithm, then using longer keys will obviously help us to counter such attacks. An algorithm is guaranteed unbreakable by brute force if a 128- bit key is used.
The differential cryptanalysis, linear cryptanalysis, are examples for statistical attacks on DES algorithm. Few of the important alternatives for DES are AES (Advanced Encryption Standard) and triple DES.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Data encryption standard (DES) | Set 1
- Double DES and Triple DES
- Difference between AES and DES ciphers
- Granovetter's Strength of Weak Ties in Social Networks
- Simplified International Data Encryption Algorithm (IDEA)
- Rail Fence Cipher - Encryption and Decryption
- RC4 Encryption Algorithm
- XOR Encryption by Shifting Plaintext
- RC5 Encryption Algorithm
- Image encryption using cellular automata
- Evolution of Malwares from Encryption to Metamorphism
- End to End Encryption (E2EE) in Computer Networks
- ElGamal Encryption Algorithm
- Public Key Encryption
- Difference between Encryption and Decryption
- Encryption, Its Algorithms And Its Future
- Difference Between Symmetric and Asymmetric Key Encryption
- What is E2EE(End to End Encryption)?
- Knapsack Encryption Algorithm in Cryptography
- What is RC4 Encryption?
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : yagneshpatil43