Practice quizzes
- January 4, 2011 - Practice for first and second quiz
- January 4, 2011 - Practice for first and second quiz
- January 4, 2011 - Practice for the second quiz
- January 27, 2011 - Practice for the third quiz
- February 8, 2011 - More practice for the third quiz
- February 15, 2011 - practice for the 4th quiz
- March 3, 2011 - practice for the 5th quiz
- March 15, 2011 - more practice for the 5th quiz
- March 15, 2011 - practice for the final
- March 15, 2011 - more practice for the final
- March 31, 2011 - even more practice for the final
NOTE: April 4, 2011 - please fill out the COURSE EVALUTION FOR THIS CLASS -
also updated office hours are announced AT MAIN PAGE
Clean slides
- January 4, 2011 - Introduction to the class
- January 4, 2011 - Historical ciphers - Ceasar's and Vigenere's
- January 4, 2011 - Historical ciphers - rectangular transposition, homophonic, Vernam, snail, Hill, Playfair
- January 13, 2011 - Slides on probability
- January 13, 2011 - Probability and craps
- January 27, 2011 - Monkey words
- January 27, 2011 - A test for monoalphabetic substitution v. pluralalphabetic substitution
- January 27, 2011 - index of coincidence (longer version, but not recommended for printing)
- January 27, 2011 - A basic inequality - we need this for breaking rectangular transposition and entropy
- January 27, 2011 - Break rectangular transposition
- February 1, 2011 - Applet to break Vigenere
- February 3, 2011 - Breaking The Rectangular Transposition Encryption System applet
- February 3, 2011 - The metropolis algorithm
- February 3, 2011 - Applet for breaking monoalphabetic substitution
- February 8, 2011 - ideas for breaking ADFGVX
- February 8, 2011 - introduction to entropy
- February 15, 2011 - unicity distance
- February 15, 2011 - unicity distance II
- February 15, 2011 - ANTS!
- March 3, 2011 - trees and codes
- March 3, 2011 - Huffman encoding and tree from heights
- March 3, 2011 - Huffman encoding and tree from heights for English
- March 3, 2011 - perfect secrecy
- March 15, 2011 - basic elements of number theory
- March 15, 2011 - the Euclidean algorithm
- March 15, 2011 - the Euler phi function
- March 15, 2011 - RSA and how it works
- March 15, 2011 - computational elements of RSA
- March 22, 2011 - Modern cryptography v. old school cryptography
- March 22, 2011 - picture of Diffie-Hellman key exchange
- March 22, 2011 - Diffie-Hellman and El Gamal
- March 22, 2011 - the discrete log problem
- March 29, 2011 - testing if a number is probably prime
- March 29, 2011 - factoring large numbers
- March 29, 2011 - the knapsack cryptosystem
- March 29, 2011 - a Feistel cypher
- March 29, 2011 - DES
Dirty slides
These are the slides after I have written on them. It is not usually useful to have these
slides on hand but you might want to refer to them.
- January 4, 2011 - Caesar and Vigenere
- January 6, 2011 - Homophonic, snail, ADFGVX and Hill
- January 13, 2011 - Hill and modular arithmetic, indpendent and dependent random variables
- January 18, 2011 - dependent/independent, roulette bets
- January 20, 2011 - disease tests, craps bets and modular arithmetic
- January 27, 2011 - 3 sticks in a bag, monkey words, index of coincidence
- February 1, 2011 - Monty Hall, quiz questions, index of coincidence
- February 3, 2011 - Another probability paradox, a functional inequality that holds for concave up functions, breaking rectangular transposition
- February 8, 2011 - Metropolis algorithm, breaking monoalphabetic substitution, beginning of entropy
- February 15, 2011 - more entropy identities and calculations
- February 17, 2011 - unicity distance
- March 3, 2011 - coins, trees, codes
- March 8, 2011 - decision trees, expected code length, perfect secrecy
- March 8, 2011 - perfect secrecy, Vernam, gcd
- March 17, 2011 - number theory computations from March 15
- March 22, 2011 - a few more number theory computations from March 15
- March 22, 2011 - Diffie-Hellman, number theory computations, RSA
- March 24, 2011 - digital signatures, RSA, using primitive roots to solve equations
- March 29, 2011 - ElGamal, babystep/giantstep, Jacobi/Legendre symbols
- March 31, 2011 - breaking RSA, Knapsack, Feistel and DES
Texts
- January 4, 2011 - Caesar, Vigenere, rectangular transposition,
homophonic, Hill, Playfair's, ADFGVX, Vernam's cipher
- January 13, 2011 - Probability vocabulary
- January 13, 2011 - Probability using roulette wheels and the game of craps.
- January 27, 2011 - Probability and cryptography
- January 27, 2011 - Index of coincidence
- January 27, 2011 - A better version of index of coincidence article
- January 27, 2011 - Using probability to break Rectangular Transposition
- February 3, 2011 - Article by Perci Diaconis about how to break monoalphabetic substitution
- February 15, 2011 - Introduction to entropy
- February 15, 2011 - Unicity distance
- March 3, 2011 - Entropy identities
- March 3, 2011 - Perfect secrecy
- March 15, 2011 - Vernam two tape system
- March 15, 2011 - Number theory computational elements
- March 15, 2011 - basic elements of RSA
- March 22, 2011 - Diffie-Hellman key exchange and primitive roots
- March 22, 2011 - How to find when a number is a primitive root without calculating every power
- March 22, 2011 - an algorithm for computing the discrete log - way harder to do than raising to a power
- March 29, 2011 - testing for primes - pseudo-ly
- March 29, 2011 - the subset sum cryptosystem - knapsack
- March 29, 2011 - the government standard for DES - the same info is in the slides (just with less words)
