InterviewSolution

Explore topic-wise InterviewSolutions in .

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

51.	What is the Discrete logarithm to the base 15 (mod 19) for a =9?(a) 3(b) 7(c) 12(d) 4The question was posed to me in an internship interview.I need to ask this question from Number Theory in chapter More Number Theory of Cryptograph & Network Security
Answer» The CORRECT ANSWER is (d) 4 To elaborate: log_15(9) mod 19 = 4.

52.	3^201 mod 11 =(a) 3(b) 5(c) 6(d) 10I got this question during an online exam.Question is from Number Theory in portion More Number Theory of Cryptograph & Network Security
Answer» The correct CHOICE is (a) 3 The explanation is: Use Fermats Theorum. FERMAT’s Theorem states that if p is prime and a is a POSITIVE integer not divisible by p, then a^(p–1) = 1 (mod p). Therefore 3^10 = 1 (mod 11). Therefore 3^201 = (3^10)^20 X 3 = 3 (mod 11).

53.	ᶲ(37)=(a) 24(b) 22(c) 13(d) 36I had been asked this question in a job interview.My question comes from Number Theory topic in section More Number Theory of Cryptograph & Network Security
Answer» Correct option is (d) 36 Explanation: 37 is a prime NUMBER HENCE ᶲ(37) = 36.

54.	What is the period of 17 (mod 19)(a) 5(b) 7(c) 9(d) 11The question was asked in an online quiz.My doubt is from Number Theory topic in chapter More Number Theory of Cryptograph & Network Security
Answer» Right CHOICE is (C) 9 To explain: 17^9 ( MOD 19) = 1.

55.	The inverse of 49 mod 37 is –(a) 31(b) 23(c) 22(d) 34I have been asked this question in a job interview.Asked question is from Number Theory topic in portion More Number Theory of Cryptograph & Network Security
Answer» Correct OPTION is (d) 34 For EXPLANATION: 49^-1 MOD 37 = 34.

56.	Find the primitive roots of G=?.(a) {2, 6, 8}(b) {2, 5, 8}(c) {3, 4, 7, 8}(d) {2, 6, 7, 8}I have been asked this question in quiz.The origin of the question is Number Theory in chapter More Number Theory of Cryptograph & Network Security
Answer» The correct CHOICE is (d) {2, 6, 7, 8} For explanation I would say: Number of primitive roots = F(f(11))=f((111-110)) = f(10)= f(2). f(5) = (21-20)(51-50) = 1 X 4 = 4 The primitive roots of this set {2, 6, 7, and 8}.

57.	Find the primitive roots of G=?.(a) {2, 6, 8}(b) {2, 5, 8}(c) {3, 4, 7, 8}(d) {2, 6, 7, 8}This question was posed to me during an online interview.My question comes from Number Theory in portion More Number Theory of Cryptograph & Network Security
Answer»

58.	If we use exponentiation to encrypt/decrypt, the adversary can use logarithm to attack and this method is very efficient.(a) True(b) FalseThis question was addressed to me in semester exam.I'd like to ask this question from Number Theory in portion More Number Theory of Cryptograph & Network Security
Answer» The CORRECT option is (b) False To explain: The first part of the statement is true. But this method is very inefficient as it uses the EXHAUSTIVE SEARCH method.

59.	Equations have either no solution or exactly three incongruent solutions(a) True(b) FalseI have been asked this question in unit test.My question is taken from Number Theory topic in division More Number Theory of Cryptograph & Network Security
Answer» The CORRECT choice is (b) False To EXPLAIN I would SAY: Equations has either no solution or exactly TWO INCONGRUENT solutions.