Q:

For n input bits the number of substitution patterns are

0

For n input bits the number of substitution patterns are


  1. 2n
  2. (2n)!
  3. 1/2n!
  4. 2n!

All Answers

need an explanation for this answer? contact us directly to get an explanation for this answer

 (b).(2n)!

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

CRYPTOGRAPHY AND NETWORK SECURITY - ENCRYPTION TECHNIQUES MCQ

This question belongs to these collections

Similar questions


need a help?


find thousands of online teachers now
In transposition, the plaintext letters are... >>
<< Encryption transformations are known as...