In that same discussion, it was stated that for the ideal block cipher, which allows all possible reversible mappings, the size of the key is n * 2n bits. But, if there are 2n! Possible mappings, it should take log2 2n! Bits to discriminate among the different mappings, and so the key length should be log2 2n! . However, log2 2n! 6 n * 2n. Explain the discrepancy
Answers
Answered by
0
Answer: Use Google
Step-by-step explanation:
Similar questions