12. Continued Fractions or Cryptography Applications

Or Modular Arithmetic In Rsa-style Systems — Quiz

Test your understanding of or modular arithmetic in rsa-style systems with 5 practice questions.

Practice Questions

Question 1

What is $(7+9)\bmod 5$?

Question 2

In an RSA-style system, if $p=3$ and $q=11$, what is $n$?

Question 3

Why is the public exponent $e$ chosen so that $\gcd(e,\varphi(n))=1$ in RSA?

Question 4

If $m=4$, $e=2$, and $n=5$, what ciphertext is produced by $c\equiv m^e\pmod n$?

Question 5

For RSA primes $p=5$ and $q=7$, what is $\varphi(n)$?