- Fast modular exponentiation
calculator
For those of you who do not have a good computing environment, this
will help a little. Since number-theoretic algorithms require
exponentiating things all the time, it would be too painful to have to
do it all purely by hand, or on a non-programmable calculator...
- The Euclidean Algorithm
- Naive factorization into primes
- The most naive primality test
- Non-prime Fermat Pseudoprimes
- The Shift Cipher
- The Affine Cipher