CS 4363 -- Cryptography
Review for Final Exam
Wednesday, 7 May 2003, 8:00 - 10:15 am
TOPICS TO STUDY:
See the mid-term review
for early topics in the course. However, emphasis on this
exam will be on topics after the mid-term, including expecially:
- The RSA cryptosystem.
- RSA details, as outlined in the
mid-term review.
- RSA's use for secrecy and for signatures.
- Rabin's variation on RSA. (But don't memorize Rabin's formulas.)
- The Advanced Encryption Standard.
- Outline of the algorithm for encryption.
- The field GF(256), with emphasis on multiplication.
- Use of "logarithms" to multiply in GF(256).
- Passwords.
- Use of passwords protected by a one-way function.
- Use of a salt.
- Lamport's scheme.
- Zero knowledge.
- Example of proving knowledge of a Hamiltonian cycle.
- Fiat-Shamir scheme for zero-knowledge identification.
- Threshold schemes.
- Details about Shamir's scheme.
Revision date: 2003-04-29.
(Please use ISO
8601, the International Standard.)