

MCQOPTIONS
Saved Bookmarks
This section includes 21 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. |
Division of (131B6C3) base 16 by (lA2F) base 16 yeilds |
A. | 1AD |
B. | DAD |
C. | BAD |
D. | 9AD |
Answer» E. | |
2. |
The plain text for the cipher text RRLMWBKASPDH. Given the encryption key[(17 17 5 | 21 18 21 | 2 2 19)]is – |
A. | PAYMOREMONEY |
B. | PAYINGRANSOM |
C. | GETINTHECAB |
D. | THEEXPRESSID |
Answer» B. PAYINGRANSOM | |
3. |
Consider the cipher text message:YJIHX RVHKK KSKHK IQQEV IFLRK QUZVA EVFYZ RVFBX UKGBP KYVVB QTAJK TGBQO ISGHU CWIKX QUXIH DUGIU LMWKG CHXJV WEKIH HEHGR EXXSF DMIIL UPSLW UPSLW AJKTR WTOWP IVXBW NPTGW EKBYU SBQWS The Index of Coincidence is |
A. | 0.065 |
B. | 0.048 |
C. | 0.067 |
D. | 0.044View Answer |
Answer» E. | |
4. |
On Encrypting “thepepsiisintherefrigerator” using Vignere Cipher System using the keyword “HUMOR” we get cipher text |
A. | abqdnwewuwjphfvrrtrfznsdokvl |
B. | abqdvmwuwjphfvvyyrfznydokvl |
C. | tbqyrvmwuwjphfvvyyrfznydokvl |
D. | baiuvmwuwjphfoeiyrfznydokvl |
Answer» C. tbqyrvmwuwjphfvvyyrfznydokvl | |
5. |
Which one of the following is not a RC5 mode of operation? |
A. | RC5 block cipher |
B. | RC5-Cipher Block Chaining |
C. | RC5-Cipher Padding |
D. | RC5-CipherText Stealing |
Answer» D. RC5-CipherText Stealing | |
6. |
Find the first 8 bits for Blum Blum Shub Bit Generator when seed = 101355 and n = 192649. |
A. | 10101010 |
B. | 11100010 |
C. | 11001011 |
D. | 11001110 |
Answer» E. | |
7. |
Maurer’s Universal Statistical Test is |
A. | a test to determine whether the number of runs of ones and zeros of various lengths is as expecte |
B. | a test to detect if a sequence can be significantly compressed without loss of information |
C. | a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p |
D. | a test for the check of evenness in the 1s and 0s |
Answer» C. a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p | |
8. |
The GCD of x5+ x4+ x3– x2 – x + 1 and x3 + x2+ x + 1 over GF(3) is |
A. | 1 |
B. | x |
C. | x + 1 |
D. | x2 + 1 |
Answer» D. x2 + 1 | |
9. |
Multiply the polynomials P1 = (x5 + x2 + x) by P2 = (x7 + x4 + x3 + x2 + x) in GF(28) with irreducible polynomial (x8 + x4 + x3 + x + 1). The result is |
A. | x4+ x3+ x+1 |
B. | x5+ x3+ x2+x+1 |
C. | x5+ x4+ x3+x+1 |
D. | x5+ x3+ x2+x |
Answer» C. x5+ x4+ x3+x+1 | |
10. |
WHICH_ONE_OF_THE_FOLLOWING_IS_NOT_A_RC5_MODE_OF_OPERATION??$ |
A. | RC5 block cipher |
B. | RC5-Cipher Block Chaining |
C. | RC5-Cipher Padding |
D. | RC5-CipherText Stealing |
Answer» D. RC5-CipherText Stealing | |
11. |
On_Encrypting_“thepepsiisintherefrigerator”_using_Vignere_Cipher_System_using_the_keyword_“HUMOR”_we_get_cipher_text$# |
A. | abqdnwewuwjphfvrrtrfznsdokvl |
B. | abqdvmwuwjphfvvyyrfznydokvl |
C. | tbqyrvmwuwjphfvvyyrfznydokvl |
D. | baiuvmwuwjphfoeiyrfznydokvl |
Answer» C. tbqyrvmwuwjphfvvyyrfznydokvl | |
12. |
The Inverse S-box value for byte stored in cell (D,2) |
A. | 0x5F |
B. | 0x2D |
C. | 0x7F |
D. | 0x5D |
Answer» C. 0x7F | |
13. |
The plain text for the cipher text RRLMWBKASPDH. Given the encryption key |
A. | ] is – |
B. | PAYMOREMONEY |
C. | PAYINGRANSOM |
D. | GETINTHECAB |
Answer» E. | |
14. |
Find the first 8 bits for Blum Blum Shub Bit Generator when seed = 101355 and n = 192649? |
A. | 10101010 |
B. | 11100010 |
C. | 11001011 |
D. | 11001110 |
Answer» E. | |
15. |
Maurer’s Universal Statistical Test is$ |
A. | a test to determine whether the number of runs of ones and zeros of various lengths is as expecte |
B. | a test to detect if a sequence can be significantly compressed without loss of information |
C. | a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p |
D. | a test for the check of evenness in the 1s and 0s |
Answer» C. a test to determine whether the number of ones and zeros in a sequence is approx the same as in a truely random o/p | |
16. |
The property that any extracted subsequence should pass the test for randomness is |
A. | Scalability |
B. | Uniformity |
C. | Stability |
D. | Consistency |
Answer» B. Uniformity | |
17. |
The GCD of x5+ x4+ x3– x2 – x + 1 and x3 + x2+ x + 1 over GF(3) is$ |
A. | 1 |
B. | x |
C. | x + 1 |
D. | x<sup>2</sup> + 1 |
Answer» D. x<sup>2</sup> + 1 | |
18. |
How many keys are used in the ANSI X9.17 PRNG? |
A. | 3 |
B. | 2 |
C. | 4 |
D. | 6 |
Answer» B. 2 | |
19. |
RC5 uses 2 magic constants to define their subkeys. These are |
A. | Base of natural Logarithm and Golden ratio |
B. | Base of natural Logarithm and Pi |
C. | Golden Ratio and Pi |
D. | Pi and Golden Ration |
Answer» B. Base of natural Logarithm and Pi | |
20. |
Multiply the polynomials P1 = (x5 + x2 + x) by P2 = (x7 + x4 + x3 + x2 + x) in GF(28) with irreducible polynomial (x8 + x4 + x3 + x + 1). The result is |
A. | x<sup>4</sup>+ x<sup>3</sup>+ x+1 |
B. | x<sup>5</sup>+ x<sup>3</sup>+ x<sup>2</sup>+x+1 |
C. | x<sup>5</sup>+ x<sup>4</sup>+ x<sup>3</sup>+x+1 |
D. | x<sup>5</sup>+ x<sup>3</sup>+ x<sup>2</sup>+x |
Answer» C. x<sup>5</sup>+ x<sup>4</sup>+ x<sup>3</sup>+x+1 | |
21. |
The number of rounds in RC5 can range from 0 to _____________ |
A. | 127 |
B. | 63 |
C. | 255 |
D. | 31 |
Answer» D. 31 | |