MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Determine the value of x, where y = 7, e = 12 and n = 566 using modular exponentiation method (x ≡ ye (mod n)). |
| A. | 735 |
| B. | 321 |
| C. | 872 |
| D. | 487 |
| Answer» E. | |
| 2. |
In cryptography system, the value of z in x ≡ ze (mod m) should be at least ______ |
| A. | 1024 bits |
| B. | 1GB |
| C. | 596 bits |
| D. | 54 Bytes |
| Answer» B. 1GB | |
| 3. |
According to congruence relation, find the remainder of 56 mod 24. |
| A. | 10 |
| B. | 12 |
| C. | 6 |
| D. | 4 |
| Answer» D. 4 | |
| 4. |
The time complexity to perform the modular exponentiation of a ≡ cg (mod m).a) O(m+ |
| A. | O(m+a) |
| B. | O(a*g) |
| C. | O(gm) |
| D. | O(g) |
| Answer» E. | |
| 5. |
Evaluate the expression 6359 mod 320. |
| A. | 681 |
| B. | 811 |
| C. | 3781 |
| D. | 279 |
| Answer» E. | |
| 6. |
If there is a unique prime number p1 then a finite field F has the property of ______________ |
| A. | p1x = 0 for all x in F |
| B. | f(x) = f(xp1) for all x in F |
| C. | p1 = y for all y in F |
| D. | xy + p1 for all x, y in F |
| Answer» B. f(x) = f(xp1) for all x in F | |
| 7. |
Which of the following methods uses the concept that exponentiation is computationally inexpensive in the finite field? |
| A. | Diffie-HEllman key exchange |
| B. | RSA key exchange |
| C. | Arithmetic key exchange |
| D. | FSM method |
| Answer» B. RSA key exchange | |
| 8. |
Which of the following algorithms has better computational complexity than standard division algorithms? |
| A. | Montgomery algorithm |
| B. | Classical modular exponentiation algorithm |
| C. | ASM algorithm |
| D. | FSM algorithm |
| Answer» C. ASM algorithm | |
| 9. |
A multiplicative monoid defines the property of exponentiation with ________ |
| A. | integer exponents |
| B. | fractional exponents |
| C. | rational exponents |
| D. | negative integer exponents |
| Answer» B. fractional exponents | |
| 10. |
If the multiplicative inverse of “53 modulo 21” exists, then which of the following is true? |
| A. | GCD(53,21) = 1 |
| B. | GCD(53,21) = 29 |
| C. | GCD(53,21) = 53 |
| D. | GCD(53,21) = 12 |
| Answer» B. GCD(53,21) = 29 | |