Math 168
Final Projects
These are the final projects for Math 168. Each title links to a PDF version of the project. The source link after the title links to the source files used to make the PDF, or other related files.
Troels Eriksen,
Advantages of Elliptic Curve Cryptography
(source)
Neal Harris,
Computing a
_{p}
For Elliptic Curves for Small-to-Medium p
Naji Jaffery
The AKS algorithm for Polynomial-Time Primality Testing
(source)
Kevin McGown:
Computing Bernoulli Numbers Quickly
(source)
Greg Musiker:
Schoof's Algorithm for Counting Points on
E
(
F
_{q}
)
(source)