CSC 412 Cryptography
The primary objective of this course is to introduce students the area of cryptography, an important current topic in computer science.
A student who successfully completes this course should, at a minimum, be able to:
- Describe classical cryptosystems such as affine and Vigenre.
- Discuss modular arithmetic including such things as the Chinese remainder theorem, Fermat's theorem, and Euler's theorem.
- Discuss finite fields, in particular GF(28).
- Discuss how DES works and how it can be attacked.
- Discuss how AES works.
- Discuss how RSA works.
- Discuss discrete logarithms and their use in cryptography.