Question: For n -bit block size, there are 2 n possible plaintext blocks and 2 n possible ciphertext blocks. If the plaintext or ciphertext is represented
- For n-bit block size, there are 2npossible plaintext blocks and 2npossible ciphertext blocks. If the plaintext or ciphertext is represented by an integer, then its value ranges from 0 to 2n 1.
-
- How many different n-bit block to n-bit block mappings are there?
- How many different reversible n-bit block to n-bit block mappings are there?
- If a reversible n-bit block mapping is used as a key for the substitution, then what would its minimum bit-length be? [Hint: If there are 64 keys altogether, then each key can be represented by log2(64) = 8 bits. This is the minimum bit length.]
-
- In class, we considered the representation of a reversible 4-bit mapping that was a 64-bit string (that was the key length). How much shorter is the key length computed in c. when n=4?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
