Understanding Cryptography by Christof Paar and Jan Pelzl - Chapter 3 Solutions - Ex3.7- 1 min
- Return to index
- Exercise 3.1
- Exercise 3.2
- Exercise 3.3
- Exercise 3.4
- Exercise 3.5
- Exercise 3.6
- Exercise 3.7
- Exercise 3.8
- Exercise 3.9
- Exercise 3.10
- Exercise 3.11
- Exercise 3.12
- Exercise 3.13
A DES key is called a weak key if encryption and decryption are identical operations:
- Describe the relationship of the subkeys in the encryption and decryption algorithm that is required so that above-defined equality is fulfilled.
- There are four weak DES keys. What are they?
- What is the likelihood that a randomly selected key is weak?
This solution is verified as correct by the official Solutions for Odd-Numbered Questions manual.
1. For to hold true, the generated subkeys must have the following relation to one another:
2. Rotating all 0s or all 1s is the only way to satisfy this criteria, since they always produce the same subkey in each round.
As such, the four weak keys are when:
Ignoring the effect of (since it’s trivial to reverse), the four possible weak keys can be defined as:
3. The likelyhood of choosing one of these weak keys at random is as follows: