The second day of class for All Girls All Math (AGAM) is over. I’m enjoying teaching the girls something about math and having an opportunity to learn some more about cryptography myself. A few finds:
- If you are interested in the Enigma machine, you can get this working paper Enigma. I haven’t tried it yet, but it seems worth playing with!
- We’re soon going to be headed to a land where we need to know lots of primes. Typically in cryptography you need large primes, but because we’ll be doing examples by hand, we’re going to use small primes. You might find this page of small primes useful: http://primes.utm.edu/lists/small/
- We’re also going to want to use a computer algorithm to do fast exponentiation for us: http://www.nebrwesleyan.edu/people/kpfabe/FastExp.html
- As an interesting note on public key cryptography, a couple of years ago the public keys for most of the TI calculators were factored — you can read a little about it here: http://www.ticalc.org/archives/news/articles/14/145/145154.html
- Sometimes we need random numbers, so here’s a generator: http://www.random.org/integers/