[Home] [Syllabus] [Assignments] [Resources and Handouts]

This page has handouts for the course and links to other helpful material. The material will be added as needed.

- A very nice Wikipedia artcile on frequencies of letters. Has frequency tables for several European languages that we will use in a homework assignment.
- A web site that lists most common English letter combinations and words
- Probabilistic Polynomial time (PP) complexity class
- Fermat Primality testing (with references to Miller-Rabin test)
- Definition of Adversary advantage, with examples. The same concept as advantage of distinguishers.
- Pseudorandomness - an article on pseudorandom number generators.
- Pollard's p-1 algorithm
- Pohlig-Hellman algorithm for solving a discrete logarithm problem for a smooth p-1.
- Discussion of the largest known primes
- Blind Signatures, includes the details of the RSA blind signatures

- Extended Euclidean algorithm applet. Computes the gcd and represents it as a linear combination of the two given numbers.
- A demo of the Vigenere cipher

- Haval - a hash function with a variable output length. Available from the GNU Crypto project.
- Java MessageDigest class

The views and opinions expressed in this page are strictly those of the page author. The contents of this page have not been reviewed or approved by the University of Minnesota.