Owen Sharpe, Department of Pure Mathematics, University of Waterloo
"Primality Testing and Integer Factorization"
Primality testing and integer factorization are mathematical problems which have occupied number theorists throughout the centuries. They have become very important in the field of cryptography over the last fifty years. We give a brief history of primality testing and integer factorization algorithms, from the sieve of Eratosthenes to the AKS test, and from trial division to Shor's algorithm.
This seminar will be held jointly online and in person:
- Room: MC 5417
- Zoom information: https://uwaterloo.zoom.us/j/94981169066?pwd=d2M1SE1qV3VCRk14WlRUaDI5WTdJZz09