Explore topic-wise MCQs in Asymmetric Ciphers.

This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Asymmetric Ciphers knowledge and support exam preparation. Choose a topic below to get started.

1.

How many primitive roots are there for 19?

A. 4
B. 5
C. 3
D. 6
Answer» E.
2.

The inverse of 37 mod 49 is

A. 23
B. 12
C. 4
D. 6
Answer» D. 6
3.

x7 = 17 (mod 29)

A. x = 8, 9, 12, 13, 15, 24, 28 (mod 29)
B. x = 8, 10, 12, 15, 18, 26, 27 (mod 29)
C. x = 8, 10, 12, 15, 17, 24, 27 (mod 29)
D. x = 8, 9, 13, 15, 17, 24, 28 (mod 29)
Answer» C. x = 8, 10, 12, 15, 17, 24, 27 (mod 29)
4.

17 x2 = 10 ( mod 29 )

A. x = 3, 22 (mod 29)
B. x = 7, 28 (mod 29)
C. x = 2, 27 (mod 29)
D. x = 4, 28 (mod 29)
Answer» D. x = 4, 28 (mod 29)
5.

How many primitive roots are there for 25?

A. 4
B. 5
C. 7
D. 8
Answer» E.
6.

Six teachers begin courses on Monday Tuesday Wednesday Thursday Friday and Saturday, respectively, and announce their intentions of lecturing at intervals of 2,3,4,1,6 and 5 days respectively. Sunday lectures are forbidden. When first will all the teachers feel compelled to omit a lecture? Use CRT.

A. 354
B. 371
C. 432
D. 213
Answer» C. 432
7.

The inverse of 49 mod 37 is

A. 31
B. 23
C. 22
D. 34
Answer» E.
8.

Consider a function: f(n) = number of elements in the set {a: 0 <= a < n and gcd(a,n) = 1}. What is this function?

A. Primitive
B. Totient
C. Primality
D. All of the mentioned
Answer» C. Primality
9.

Find x for the CRT when x= 2 mod 3; x= 3 mod 5; x = 2 mod 7

A. 33
B. 22
C. 23
D. 31
Answer» D. 31
10.

n is prime if and only if n divides (2n 2).

A. True
B. False
Answer» C.
11.

(231)=

A. 230
B. 60
C. 80
D. 120
Answer» E.