InterviewSolution
Saved Bookmarks
| 1. |
For n input bits the number of substitution patterns are(a) 2n(b) (2n)!(c) 1/2n!(d) 2n!I have been asked this question in an interview for internship.Query is from Public Key Cryptosystems topic in chapter Encryption and Decryption of Digital Communications |
| Answer» | |