Jonathan Hanke's Website

Research and Software in Number Theory

Math 4450/6450 — Spring 2010 (Cryptography)

without comments


General Information:

  • Course Outline (PDF)
  • Course Syllabus (PDF)

Homework Assignments:

  1. Cryptogram without spaces (PDF)
  2. Security Assessments, modular arithmetic, and Vigenere (PDF)
  3. Hill , Playfair, and Permutation Ciphers (PDF)
  4. Diffie-Hellman and Arithmetic in $\mathbb{Z}/p\mathbb{Z}$ (PDF)
  5. Primality Tests and Factoring Algorithms (PDF)
  6. Discrete Log Attacks (PDF)
  7. Error Detecting and Error Correcting Codes (PDF)


  • Exam #1 (PDF)
  • Exam #2 (PDF)
  • Final Exam (PDF)

Final Paper/Talk Topics:

  • “Using Genetic Algorithms to Solve Classical Cryptosystems” — Jacob Hicks
  • “The Mathematics behind the Enigma Machine” — Megan Dickerson
  • “Elliptic Curve Cryptography” — Andrew Talian

To receive graduate credit for this course (i.e. for Math 6450), students were asked to write a final paper and give a one hour talk on an advanced topic in cryptography.

Sage/Python Crypto Routines:

  • Some routines to compute $n$-graph letter statistics for ciphertext (crypto.sage)

Written by jonhanke

February 1st, 2012 at 2:36 pm

Posted in

Leave a Reply