MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 16 Mcqs, each offering curated multiple-choice questions to sharpen your Cryptography and Network Security knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following slows the cryptographic algorithm –1) Increase in Number of rounds2) Decrease in Block size3) Decrease in Key Size4) Increase in Sub key Generation |
| A. | 1 and 3 |
| B. | 2 and 3 |
| C. | 3 and 4 |
| D. | 2 and 4View Answer |
| Answer» C. 3 and 4 | |
| 2. |
This is an example of |
| A. | SP Networks |
| B. | Feistel Cipher |
| C. | Hash Algorithm |
| D. | Hill CipherView Answer |
| Answer» C. Hash Algorithm | |
| 3. |
The S-Box is used to provide confusion, as it is dependent on the unknown key. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
Confusion hides the relationship between the ciphertext and the plaintext. |
| A. | True |
| B. | False |
| Answer» C. | |
| 5. |
If the key is 110100001 where,If ki=0, then S_i (x)=((1 1 0 | 0 1 1 | 1 0 0 ))x+((1 1 1))and If ki=1, then S_i (x)=((0 1 1 | 1 0 1 | 1 0 0))x+((0 1 1))then the output of the SP network for the plaintext: 101110001 is |
| A. | 010110011 |
| B. | 111000011 |
| C. | 110110111 |
| D. | 010110110 |
| Answer» B. 111000011 | |
| 6. |
If the block size is ‘s’, how many affine transformations are possible ? |
| A. | 2s (2s-1)(2s-1)(2s-12)………(2s-1(s-1)) |
| B. | 2s (2s-1)(2s-2)(2s-22)………(2s-2(s-2)) |
| C. | 2ss (2s-1)(2s-2)(2s-22)………(2s-2(s-1)) |
| D. | 2s (2s-1)(2s-2)(2s-22)………(2s-2(s-3)) |
| Answer» D. 2s (2s-1)(2s-2)(2s-22)………(2s-2(s-3)) | |
| 7. |
In affine block cipher systems if f(m)=Am + t, what is f(m1+m2+m3) ? |
| A. | f(m1) + f(m2) + f(m3) + t |
| B. | f(m1) + f(m2) + f(m3) +2t |
| C. | f(m1) + f(m2) + f(m3) |
| D. | 2(f(m1) + f(m2) + f(m3)) |
| Answer» D. 2(f(m1) + f(m2) + f(m3)) | |
| 8. |
THE_S-BOX_IS_USED_TO_PROVIDE_CONFUSION,_AS_IT_IS_DEPENDENT_ON_THE_UNKNOWN_KEY.?$ |
| A. | True |
| B. | False |
| Answer» B. False | |
| 9. |
SP Networks$ |
| A. | Feistel Cipher |
| B. | Hash Algorithm |
| C. | Hill Cipher |
| Answer» C. Hill Cipher | |
| 10. |
Confusion hides the relationship between the ciphertext and the plaintext? |
| A. | True |
| B. | False |
| Answer» C. | |
| 11. |
If the key is 110100001 where, |
| A. | =((1 1 0 | 0 1 1 | 1 0 0 ))x+((1 1 1)) |
| B. | =((0 1 1 | 1 0 1 | 1 0 0))x+((0 1 1)) |
| C. | |
| Answer» B. =((0 1 1 | 1 0 1 | 1 0 0))x+((0 1 1)) | |
| 12. |
If the key is 110100001, the output of the SP network for the plaintext: 101110001 is |
| A. | 110100011 |
| B. | 110101110 |
| C. | 010110111 |
| D. | 011111010 |
| Answer» C. 010110111 | |
| 13. |
Super-Encipherment using two affine transformations results in another affine transformation. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 14. |
What is the number of possible 3 x 3 affine cipher transformations ? |
| A. | 168 |
| B. | 840 |
| C. | 1024 |
| D. | 1344 |
| Answer» E. | |
| 15. |
If the block size is ‘s’, how many affine transformations are possible ?$ |
| A. | 2<sup>s</sup> (2<sup>s</sup>-1)(2<sup>s</sup>-1)(2<sup>s</sup>-1<sup>2</sup>)………(2<sup>s</sup>-1<sup>(s-1)</sup>) |
| B. | 2<sup>s</sup> (2<sup>s</sup>-1)(2<sup>s</sup>-2)(2<sup>s</sup>-2<sup>2</sup>)………(2<sup>s</sup>-2<sup>(s-2)</sup>) |
| C. | 2<sup>s</sup>s (2<sup>s</sup>-1)(2<sup>s</sup>-2)(2<sup>s</sup>-2<sup>2</sup>)………(2<sup>s</sup>-2<sup>(s-1)</sup>) |
| D. | 2<sup>s</sup> (2<sup>s</sup>-1)(2<sup>s</sup>-2)(2<sup>s</sup>-2<sup>2</sup>)………(2<sup>s</sup>-2<sup>(s-3)</sup>) |
| Answer» D. 2<sup>s</sup> (2<sup>s</sup>-1)(2<sup>s</sup>-2)(2<sup>s</sup>-2<sup>2</sup>)‚Äö√Ñ√∂‚àö√묨‚àÇ‚Äö√Ñ√∂‚àö√묨‚àÇ‚Äö√Ñ√∂‚àö√묨‚àÇ(2<sup>s</sup>-2<sup>(s-3)</sup>) | |
| 16. |
In affine block cipher systems if f(m)=Am + t, what is f(m1+m2) ? |
| A. | f(m1) + f(m2) + t |
| B. | f(m1) + f(m2) + 2t |
| C. | f(m1) + t |
| D. | f(m1) + f(m2) |
| Answer» B. f(m1) + f(m2) + 2t | |