Teaching coding theory and cryptography page

• Prof Sudan's MIT lecture notes on error-correcting codes
• USNA Applied abstract algebra course page
• USNA error-correcting codes course page 2003-4 2001-2
• How to Get Rich off Finnish Football Fans, (appeared in volume 1, 1994 Tangents: Harvard-Radcliff Math Bulletin)
• A basic survey of the theory of error-correcting codes (appeared in volume 1, 1994 Tangents: Harvard-Radcliff Math Bulletin)
• A brief history of error-correcting codes
• A beginners introduction to error-correcting codes html
• error-correcting codes links page (many are dead, so be warned)
• Prof. Alasdair McAndrew's Cryptology using Axiom page
• Gray codes
• Golay codes
• GUAVA
• MAPLE worksheet (in html form) for basic routines on cyclic, binary Hamming, and Golay codes (as well as some string-theoretic commands). An updated version of the corresponding MAPLE worksheet codes0.mws and MAPLE package codes.mpl is explained in cyclic, binary Hamming, and Golay codes. Written by D Joyner, 1998, updated 2001.
• MAPLE exercises in coding theory,
• GAP exercises in coding theory,
• MAGMA exercises in coding theory,
• MAPLE worksheets for basic routines in cryptography:
  • basic string-theoretic commands useful for decoding "classical" encryptions (this uses the text file paradise_lost.mpl)
  • random stream encryption using MAPLE's random number generator
  Corresponding MAPLE package crypto.mpl. Written by D Joyner, 1998.
• Worksheets of John Cosgrave (St. Patrick's College, Drumcondra, Dublin 9, Ireland, John.Cosgrave@spd.dcu.ie), included here by permission:
  1. PRIME NUMBERS and PUBLIC-KEY CRYPTOGRAPHY (this worksheet is available in html)
  2. Pollard's 'p-1' factoring method
  3. Fermat factorisation
  4. Pollard-rho factoring method, using the Floyd cycle algorithm
  5. Euclidean algorithm for calculating gcd's
  6. Lucas-(Kraitchik)-Lehmer-Selfridge theorem (primality testing)
  7. Selfridge's improvement of the Lucas-Kraitchik-Lehmer theorem (primality testing)
  8. Digital signatures
  9. public lecture: "Bill Clinton, Bertie Ahern and digital signatures"
  10. exposition of Pocklington's 1914-1916 paper
  11. the 'millennium' prime calculations (referred to in Ivars Peterson's Mathland column in Science News for January 16, 1999).
• Yahoo's cryptography page
• Rivest's crypto and computer security links
• Aron Foster's project on A polynomial-time probabilistic algorithm for the minimum distance of an arbitrary linear error-correcting code
• Mr Hanley's report on the Enigma
• Frode Weierud's cryptology page
• Mr Cooper's report on the Enigma
• SM230 report on the Bible code, by a student who wishes to remain anonymous
• Mr Hanley's report on Reed-Solomon codes

home