Crypto and Number Theory Interactive Stuff

[ garrett@math.umn.edu ] ... [ my crypto page ]

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

© 1997-98, Paul Garrett ... [ home ] ... [ garrett@math.umn.edu ] The University of Minnesota explicitly requires that I state that "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."