MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 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. |
The time complexity to perform the modular exponentiation of a cg (mod m). |
| A. | O(m+a) |
| B. | O(a*g) |
| C. | O(gm) |
| D. | O(g) |
| Answer» E. | |
| 4. |
If there is a unique prime number p1 then a finite field F has the property of ______________ |
| A. | p<sub>1</sub>x = 0 for all x in F |
| B. | f(x) = f(xp<sub>1</sub>) for all x in F |
| C. | p<sub>1</sub> = y for all y in F |
| D. | xy + p<sub>1</sub> for all x, y in F |
| Answer» B. f(x) = f(xp<sub>1</sub>) for all x in F | |
| 5. |
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 | |