|
|
Contents
|
|
| Week 1: |
Introduction and overview |
| Week 2: |
Bezouts identity, Euclids algorithm, extended Euclids algorithm, modular inverses. |
| Week 3: |
Modular arithmetic, finite fields, prime fields, extension fields. |
| Week 4: |
Binary fields, AES (Advanced Encryption Standard). |
| Week 5: |
AES and block cipher modes of operation. |
| Week 6: |
Hash algorithms, collisions, birth day paradox. |
| Week 7: |
Euler's function, Euler’s theorem, Fermat's little theorem, element orders, primitive roots, primality testing. |
| Week 8: |
RSA public key algorithm, RSA signatures, fast modular exponentiation, Chinese residue theorem. |
| Week 9: |
Midterm exam |
| Week 10: |
Discrete logarithms, the Diffie-Hellman key exchange algorithm, the ElGamal public key cryptosystem. |
| Week 11: |
Elliptic curve public key cryptography 1. |
| Week 12: |
Elliptic curve public key cryptography 2. |
| Week 13: |
DSA, Elliptic curve digital signatures. |
| Week 14: |
Certificates, SSL. |
| Week 15*: |
|
| Week 16*: |
Final exam |
| Textbooks and materials: |
Cryptography and Network Security: Principles and Practice, 5/E William Stallings, Prentice Hall 2011.
|
| Recommended readings: |
Handbook of Applied Cryptography, A. Menezes, P. Van Oorschot, and S. Vanstone, CRC Press 1996. |
|
|
* Between 15th and 16th weeks is there a free week for students to prepare for final exam.
|
|
