CS588: Cryptology - Principles and Applications, Fall 2001
Anonymous, ungraded quiz. Don't put your name on it. Don't use your book or notes.
- How well do you feel you understand RSA?
- I broke it yesterday. The NSA has threatened to do bad things to me if I tell you how, though.
- Well enough to implement it.
- I understand almost everything in the RSA paper.
- Sort of.
- Not really.
- No clue at all.
- Here is the RSA algorithm, with some pieces missing. Fill in the blanks:
- Pick 2 large secret primes, p and q.
- Let n = _______________ [blank 1]
- Choose e and d so: ed ≡ 1 mod _____________ [blank 2]
- Encryption function (public): E(M) = Me mod n.
- Decryption function (private): D(C) = ___________________ [blank 3]
- What is the private key?
- What is the range of M that can be reliably transmitted using RSA?
- What specific things we have covered in class so far (not limited to just RSA) are you confused on?
- Lectures are: ___ Way too fast ___ Too fast ___ Too slow ___ Way too slow
- Any suggestions or comments for improving the remainder of the course?
University of Virginia
Department of Computer Science
CS 588: Cryptology - Principles and Applications