MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 17 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. |
The multiplicative Inverse of 1234 mod 4321 is |
| A. | 3239 |
| B. | 3213 |
| C. | 3242 |
| D. | Does not exist |
| Answer» B. 3213 | |
| 2. |
117 mod 13 = |
| A. | 3 |
| B. | 7 |
| C. | 5 |
| D. | 15 |
| Answer» E. | |
| 3. |
[(a mod n) – (b mod n)] mod n = (b – a) mod n |
| A. | mod na) True |
| B. | False |
| Answer» C. | |
| 4. |
[(a mod n) + (b mod n)] mod n = (a+b) mod n |
| A. | True |
| B. | mod na) Trueb) False |
| Answer» B. mod na) Trueb) False | |
| 5. |
[(A_MOD_N)_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬®_(B_MOD_N)]_MOD_N_=_(B_‚ÄÖ√Ñ√∂‚ÀÖ√Ë‚ÀÖ¬®_A)_MOD_N?$# |
| A. | True |
| B. | False |
| Answer» C. | |
| 6. |
The multiplicative Inverse of 1234 mod 4321 is$ |
| A. | 3239 |
| B. | 3213 |
| C. | 3242 |
| D. | Does not exist |
| Answer» B. 3213 | |
| 7. |
117 mod 13 =$ |
| A. | 3 |
| B. | 7 |
| C. | 5 |
| D. | 15 |
| Answer» E. | |
| 8. |
The multiplicative Inverse of 24140 mod 40902 is |
| A. | 2355 |
| B. | 5343 |
| C. | 3534 |
| D. | Does not exist |
| Answer» E. | |
| 9. |
The multiplicative Inverse of 550 mod 1769 is |
| A. | 434 |
| B. | 224 |
| C. | 550 |
| D. | Does not exist |
| Answer» B. 224 | |
| 10. |
[(a mod n) + (b mod n)] mod n = (a+b) mod ? |
| A. | True |
| B. | False |
| Answer» B. False | |
| 11. |
Which of the following is a valid property for concurrency? |
| A. | a = b (mod n) if n|(a-b) |
| B. | a = b (mod n) implies b = a (mod n) |
| C. | a = b (mod n) and b = c (mod n) implies a = c (mod n) |
| D. | All of the mentioned |
| Answer» E. | |
| 12. |
What is 11 mod 7 and -11 mod 7? |
| A. | 4 and 5 |
| B. | 4 and 4 |
| C. | 5 and 3 |
| D. | 4 and -4 |
| Answer» E. | |
| 13. |
Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm. |
| A. | 13 |
| B. | 12 |
| C. | 17 |
| D. | 7 |
| Answer» B. 12 | |
| 14. |
Calculate the GCD of 102947526 and 239821932 using Euclidean algorithm. |
| A. | 11 |
| B. | 12 |
| C. | 8 |
| D. | 6 |
| Answer» E. | |
| 15. |
Calculate the GCD of 1160718174 and 316258250 using Euclidean algorithm. |
| A. | 882 |
| B. | 770 |
| C. | 1078 |
| D. | 1225 |
| Answer» D. 1225 | |
| 16. |
GCD(a,b) is the same as GCD(|a|,|b|). |
| A. | True |
| B. | False |
| Answer» B. False | |
| 17. |
If a|b and b|c, then a|c. |
| A. | True |
| B. | False |
| Answer» B. False | |