Course Content
Detailed Content of Network Security
0/1
Network Security
About Lesson

Data Encryption Standards (DES):

Data Encryption Standards (DES) are cryptographic algorithms used to encrypt and decrypt data. Developed in the 1970s, DES was widely used for secure communication. However, due to vulnerabilities, it was replaced by Advanced Encryption Standard (AES) in 2001. AES offers stronger security and performance, supporting key sizes of 128, 192, or 256 bits.

The Data Encryption Standard (DES) uses a symmetric-key algorithm, meaning the same key is used for both encryption and decryption. Here’s a brief overview of how the DES algorithm works:

  1. Key Generation: DES operates on 64-bit blocks of plaintext and uses a 56-bit key for encryption. The key is initially 64 bits, but 8 bits are used for parity checking and discarded, leaving 56 effective bits. However, the effective key length is 56 bits due to the use of parity bits.
  2. Initial Permutation (IP): The 64-bit plaintext block is subjected to an initial permutation.
  3. Key Expansion: The 56-bit key is expanded and permuted to generate 16 round keys, each 48 bits long, used in the encryption process.
  4. Rounds: DES operates through 16 rounds of encryption, each involving several operations:
  • Expansion: The 32-bit right half of the data is expanded to 48 bits.
  • Key Mixing: The expanded data is XORed with the round key.
  • S-box Substitution: The result is divided into eight 6-bit blocks, each passed through a different S-box (substitution box).
  • Permutation: The outputs from the S-boxes are concatenated and permuted.
  • Feistel Function: A function combining expansion, key mixing, S-box substitution, and permutation is applied to the data.
  1. Final Permutation (FP): After 16 rounds, a final permutation is applied to the data.
  2. Output: The permuted data is the ciphertext.

The limited DES mode available in the freeware version of Enigma modifies the DES standards in two ways. first of all, a 32 bit key used instead of 56 bits, secondly, the data is interated on only 4 times instead of 16. these changes reduces the computational complexity of the algorithm by atleast 2^26 times. morever a new user would still have to guess on average 2 billion times before the correct key was determined however, by using only 4 iteration over the F module there are known attacks better than brute force which could be used for a more sophisticated attack.

Cipher Block Chaining (CBC) is a mode of operation for block ciphers. In CBC, each plaintext block is XORed with the previous ciphertext block before encryption, which introduces diffusion and reduces the likelihood of identical blocks producing the same ciphertext. It requires an initialization vector (IV) to start the process and is widely used in secure communication protocols like SSL/TLS and IPsec.

The security of DES (Data Encryption Standard) is considered weak by modern standards due to its relatively short key length of 56 bits. With advancements in computing power, DES can be vulnerable to brute-force attacks, where an attacker tries all possible keys until finding the correct one. The 56-bit key length means there are only 256256 possible keys, which can be feasibly brute-forced with modern computing resources.