100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Crypto Final UPDATED Actual Exam Questions and CORRECT Answers CA$13.27   Add to cart
Quickly navigate to
Preview
  2.  
  3. Crypto
  4.  
  5. Crypto

Exam (elaborations)

Crypto Final UPDATED Actual Exam Questions and CORRECT Answers
 0 view  0 purchase
  • Course
  • Crypto
  • Institution
  • Crypto

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 num...

[Show more]

Preview 2 out of 10  pages

Document information

  • October 5, 2024
  • 10
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

  • crypto final
  • crypto

Written for

  • Crypto
  • Crypto

Seller

avatar-seller
MGRADES

Reviews received

Content preview

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

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller MGRADES. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for CA$13.27. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

76710 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
CA$13.27
  • (0)
  Add to cart