Knowledge check
10 questions testing what you just read — no login, no tracking, just immediate feedback.
When does a's modular inverse mod n exist?
What is a trapdoor function?
What do Diffie-Hellman's modular exponentiation and ECC's point addition have in common, mathematically?
What does "a ≡ b (mod n)" mean?
What algebraic property of modular arithmetic makes huge exponentiations, as used in RSA and Diffie-Hellman, practical?
What four properties define a mathematical "group"?
How do RSA's factoring problem and ECC's discrete-log problem differ, according to this module?
In this module's terms, what does "computationally hard" mean, as opposed to "mathematically impossible"?
What does Shor's algorithm actually do, according to this module?
How does division work in modular arithmetic, since there's no ordinary fraction inside a finite set of remainders?