Crypto Final UPDATED Actual Exam Questions and CORRECT Answers

Crypto Final UPDATED Actual Exam
Questions and CORRECT Answers
TRUE/FALSE: Prime numbers play a very small role in cryptography. - CORRECT
ANSWER✔✔- 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. - CORRECT ANSWER✔✔- True


TRUE/FALSE: An important requirement in a number of cryptographic algorithms is the
ability to choose a large prime number. - CORRECT ANSWER✔✔- True



TRUE/FALSE: All integers have primitive roots. - CORRECT ANSWER✔✔- 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. - CORRECT
ANSWER✔✔- True


TRUE/FALSE: The first assertion of the CRT, concerning arithmetic operations, follows from
the rules for modular arithmetic. - CORRECT ANSWER✔✔- False


TRUE/FALSE: Discrete logarithms are not fundamental to public-key algorithms. -
CORRECT ANSWER✔✔- False


TRUE/FALSE: The number 37 is prime so therefore all of the positive integers from 1 to 36
are relatively prime to 37. - CORRECT ANSWER✔✔- True


TRUE/FALSE: Discrete logarithms are analogous to ordinary logarithms but are defined
using modular arithmetic. - CORRECT ANSWER✔✔- True


TRUE/FALSE: The Chinese Remainder Theorem is believed to have been discovered by the
Chinese mathematician Agrawal in 100 A.D. - CORRECT ANSWER✔✔- False

, TRUE/FALSE: The primitive roots for the prime number 19 are 2, 3, 10, 13, 14 and 15. -
CORRECT ANSWER✔✔- True


TRUE/FALSE: With ordinary positive real numbers the logarithm function is the inverse of
exponentiation. - CORRECT ANSWER✔✔- True


TRUE/FALSE: A prime number can have a remainder when divided by positive or negative
values of itself. - CORRECT ANSWER✔✔- False


TRUE/FALSE: The Miller-Rabin test can determine if a number is not prime but cannot
determine if a number is prime. - CORRECT ANSWER✔✔- True


TRUE/FALSE: The logarithm of a number is defined to be the power to which some positive
base (except 1) must be raised in order to equal the number. - CORRECT ANSWER✔✔-
True


A __________ number is an integer that can only be divided by positive and negative values
of itself and 1 without having a remainder. - CORRECT ANSWER✔✔- prime


Two theorems that play important roles in public-key cryptography are Fermat's theorem and
__________ theorem. - CORRECT ANSWER✔✔- Euler's


Discrete logarithms are analogous to ordinary logarithms but are defined using __________
arithmetic - CORRECT ANSWER✔✔- modular


__________ theorem states the following: If p is prime and a is a positive integer not
divisible by p, then a^(p-1) = 1(mod p). - CORRECT ANSWER✔✔- Fermat's


Two numbers are __________ if their greatest common divisor is 1. - CORRECT
ANSWER✔✔- relatively prime