1. Engineering
  2. Computer Science
  3. 1 using this playfair matrix encrypt the following message 2...

Question: 1 using this playfair matrix encrypt the following message 2...

Question details

1. Using this Playfair matrix encrypt the following message: 2. For n-bit bloc ck size, there are 2 possible plaintext blocks and 2 possible ciphertext blocks. If the plaintext or ciphertext is represented by an integer, then its value ranges from 0 to 2-1. a. How many different n-bit block to n-bit block mappings are there? b. How many different reversible n-bit block to n-bit block mappings are there? c. 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 log.(64) - bit length.] 8 bits. This is the minimum d. In class we considered the representation of a reversible 4-bit mapping that was a 4 x 2* 64-bit string (we took this as the key). How much shorter is the (minimal) key length computed in (c) when -4?

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution