Crypto Final Exam Questions with Correct Answers 100% Solved

Crypto Final Exam Questions with Correct Answers 100% Solved TRUE/FALSE: Prime numbers play a very small role in cryptography. False TRUE/FALSE: One of the useful features of the Chinese remainder theorem is that it provides a way to manipulate potentially very large numbers mod M in terms of tuples of smaller numbers. True TRUE/FALSE: An important requirement in a number of cryptographic algorithms is the ability to choose a large prime number. True TRUE/FALSE: All integers have primitive roots. False TRUE/FALSE: An area of ongoing research is the development of efficient algorithms for determining if a randomly chosen large integer is a prime number. True TRUE/FALSE: The first assertion of the CRT, concerning arithmetic operations, follows from the rules for modular arithmetic. False TRUE/FALSE: Discrete logarithms are not fundamental to public-key algorithms. False TRUE/FALSE: The number 37 is prime so therefore all of the positive integers from 1 to 36 are relatively prime to 37. True TRUE/FALSE: Discrete logarithms are analogous to ordinary logarithms but are defined using modular arithmetic. True TRUE/FALSE: The Chinese Remainder Theorem is believed to have been discovered by the Chinese mathematician Agrawal in 100 A.D. False TRUE/FALSE: The primitive roots for the prime number 19 are 2, 3, 10, 13, 14 and 15. True TRUE/FALSE: With ordinary positive real numbers the logarithm function is the inverse of exponentiation. True TRUE/FALSE: A prime number can have a remainder when divided by positive or negative values of itself. False