Lecture slides

Padding in symmetric encryption

Hashing Functions Practical Implications (Bill Burr, NIST)

Lecture notes for Public Key Cryptography

• Primes and modular arithmetic
• Proof of Fermat's Little Theorem
• Explanation of the extended Euclidean algorithm. An excellent algorithmic description by Bruce Ikenaga at Millersville University.
• RSA and the totient function  (PDF version)

Certificates and PKI

• Ten Risks of PKI

Kerberos

• Protect Yourself Against Kerberos Attacks (required reading)
• Attacks on Kerberos V (optional material, search google for further Kerberos info)

Malware Lecture Resources

• Ken Thompson Compiler Hack (required reading)

Buffer Overflow Lecture Resources

• Stack Guard Paper (required reading)

Integer Manipulation Vulnerabilities

• Integer Manipulation Vulnerabilities (required reading)