Codes and Cryptography | Spring 2015 |
MWF 2:00 - 2:50 | location TBA |
Instructor Bonnie Saunders | |
This course will cover a broad selection of cryptography and coding theory topics including classical cryptography, DES and RSA algorithms, discrete logarithms, hash functions and error correcting codes. Topics will be presented from a mathematical point of view. The number theory covered will include modular arithmetic, linear diophantine equations, Fermat and Euler theorems, modular exponentiation and logarithms. Depending on the interest of the students, we may also discuss finite fields (mainly for the AES algorithm) and/or elliptic curve cryptography. The topics require some computation and programming. We will be using the Python Programming Language. No previous experience is necessary. There will be an opportunity to do more programming for the interested student. |
||
Required materials:
Introduction to Cryptography with Coding Theory |
||
Introduction to Python Programming: The Python Tutorial from the official Python webpages. |
||
Google for links to the following sources:
RSA Laboratories |
||
Some pdf files of interest:
The RSA patent |
||
Other algorithms of interest:
Sieve of Atkins is used for finding prime numbers. Code for this sieve appears in this Wikipedia article: |
||
Links to online activities: |
||
Understanding Common Factor Attacks:
An RSA-Cracking Puzzle. CryptoClub.org |
||
--Last updated December 2014 by Bonnie Saunders