Cryptography Unit 4 MCQs

B.
Tech VI Semester -2024

Branch Name: AI & ML
Subject Name: Cryptography
UNIT-4
An integer p>1 is a prime number if and only if its only divisors are d) +1 & +p
a) +1 only
1 b) 0 & +p
c) +p & +p+1
d) +1 & +p
2 Which of the following is Fermat’s theorem statement? a) If p is prime
a) If p is prime and a is a positive integer not divisible by p, then and a is a positive
ap-1 = 1 (mod p) integer not divis-
b)If p is prime and a is a positive integer not divisible by p, then ible by p, then
ap= 1 (mod p) ap-1 = 1 (mod p)
c)If p is prime and a is a positive integer not divisible by p, then
ap-1 = p (mod p-1)
d) If p is prime and a is a positive integer not divisible by p, then
a(p-1) = 1 (mod p)
3 Consider a function: f(n) = number of elements in the set {a: 0 <= a < b) Totient
n and gcd(a,n) = 1}. What is this function?
a) Primitive
b) Totient
c) Primality
d) All of the mentioned
The inverse of 49 mod 37 is – d) 34

a) 31
4 b) 23
c) 22
d) 34
5 n is prime if and only if n divides (2n – 2). b) False

a) True
b) False
6 How many primitive roots are there for 25? d) 8

a) 4
b) 5
c) 7
d) 8
7 x– 4x – 16 = 0 (mod 29) b) x = 9, 24 (mod
a) x = 6, 24 (mod 29) 29)
b) x = 9, 24 (mod 29)
c) x = 9, 22 (mod 29)
d) x = 6, 22 (mod 29)
8 Which of the following counts the number of integers between 1 and a) Euler’s totient
N, which are relatively prime to N? function
a) Euler’s totient function
b) Catalan numbers
c) Factorial of a number
d) Fibonacci series
9 What does the Chinese Remainder Theorem primarily deal c) Finding an un-
with? known number
a) Finding prime numbers from its remain-
b) Solving linear equations ders with respect
c) Finding an unknown number from its remainders with re- to several pair-
spect to several pairwise coprime divisors wise coprime di-
d) Calculating the greatest common divisor of two numbers visors
10 Suppose you have the following system of congruences: c) 62
 x≡2mod3
 x≡3mod5
 x≡2mod7
What is the smallest positive integer solution for x?
a) 23
b) 52
c) 62
d) 142
11 Which of the following operations in cryptography is NOT b) Symmetric key

directly improved by the application of the Chinese Re- encryption
mainder Theorem?
a) Key generation in RSA

b) Symmetric key encryption
c) Decryption using RSA
d) Digital signature verification
12 What is the Discrete logarithm to the base 10 (mod 19) for a =7? a) 12
a) 12
b) 14
c) 8
d) 11
13 What is the Discrete logarithm to the base 13 (mod 19) for a =13? b) 1
a) 14
b) 1
c) 8
d) 17
14 ᶲ(440)= c) 160
a) 200
b) 180
c) 160
d) 220
15 GCD(n,n+1) = 1 always. a) True

a) True
b) False
16 RSA is also a stream cipher like Merkel-Hellman. a) True

a) True
b) False
17 In RSA, Ф(n) = _______ in terms of p and q. c) (p-1)(q-1)

a) (p)/(q)
b) (p)(q)
c) (p-1)(q-1)
d) (p+1)(q+1)
18 For p = 11 and q = 19 and choose e=17. Apply RSA algorithm where a) C=80
message=5 and find the cipher text.
a) C=80
b) C=92
c) C=56
d) C=23
19 Perform encryption on the following PT using RSA and find b) 26

the CT p = 3; q = 11; M = 5
a) 28
b) 26
c) 18
d) 12
20 n = 35; e = 5; C = 10. What is the plaintext (use RSA) ? d) 5

a) 3
b) 7
c) 8
d) 5
21 How many bytes of the secret key is generated using Diffie-Hellman a) 256
encryption/decryption scheme?
a) 256
b) 871
c) 1024
d) 962
22 What is the general equation for elliptic curve systems? d) y2+b_1 xy+b_2
a) y3+b_1 xy+b_2 y=x33+a_1 x2+a_2 x+a_3 y=x3+a_1 x2+a_2
b) y3+b_1 x+b_2 y=x2+a_1 x2+a_2 x+a_3 x+a_3
c) y2+b_1 xy+b_2 y=x3+a_1 x2+a_2
d) y2+b_1 xy+b_2 y=x3+a_1 x2+a_2 x+a_3
23 How many real and imaginary roots does the equation d) 2 imaginary, 1
y2=x3-1 have real
a) 2 real, 1 imaginary
b) all real
c) all imaginary
d) 2 imaginary, 1 real
24 In the elliptic curve group defined by y2= x3- 17x + 16 over a) (15, -56)
real numbers, what is P + Q if P = (0,-4) and Q = (1, 0)?
a) (15, -56)
b) (-23, -43)
c) (69, 26)
d) (12, -86)
25 “Elliptic curve cryptography follows the associative prop- a) True

erty.”
a) True
b) False
26 “In ECC, the inverse of point P =(x1, y1) is Q = (-x1, y1). “ b) False
a) True
b) False
27 In RSA, we select a value ‘e’ such that it lies between 0 and b) False
Ф(n) and it is relatively prime to Ф(n).
a) True
b) False
28 In the RSA algorithm, we select 2 random large values ‘p’ and c) p and q
‘q’. Which of the following is the property of ‘p’ and ‘q’? should be prime
a) p and q should be divisible by Ф(n)
b) p and q should be co-prime
c) p and q should be prime
d) p/q should give no remainder
29 Computation of the discrete logarithm is the basis of the c) Diffie-Hellman

cryptographic system _______ key exchange
a) Symmetric cryptography
b) Asymmetric cryptography
c) Diffie-Hellman key exchange
d) Secret key cryptography
30 Find the value of x: 3 x2 alog x = 348?

a d) 4.8
a) 7.1
b) 4.5
c) 6.2
d) 4.8

Cryptography Unit 4 MCQs

Uploaded by

Copyright:

Available Formats

Cryptography Unit 4 MCQs

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cryptography Unit 4 MCQs

Uploaded by

Copyright:

Available Formats

B.

Tech VI Semester -2024

The inverse of 49 mod 37 is – d) 34

5 n is prime if and only if n divides (2n – 2). b) False

6 How many primitive roots are there for 25? d) 8

10 Suppose you have the following system of congruences: c) 62

What is the smallest positive integer solution for x?

11 Which of the following operations in cryptography is NOT b) Symmetric key

a) Key generation in RSA

15 GCD(n,n+1) = 1 always. a) True

16 RSA is also a stream cipher like Merkel-Hellman. a) True

17 In RSA, Ф(n) = _______ in terms of p and q. c) (p-1)(q-1)

19 Perform encryption on the following PT using RSA and find b) 26

20 n = 35; e = 5; C = 10. What is the plaintext (use RSA) ? d) 5

25 “Elliptic curve cryptography follows the associative prop- a) True

29 Computation of the discrete logarithm is the basis of the c) Diffie-Hellman

30 Find the value of x: 3 x2 alog x = 348?

You might also like