In this thesis we give an in-depth introduction to the General Number Field Sieve, as it was used by Buhler, Lenstra, and Pomerance, , before looking at one of the modern developments of this algorithm: A randomized version with provable complexity. This version was posited in 2017 by Lee and Venkatesan, , and will be preceded by ample material from both algebraic and analytic number theory, Galois theory, and probability theory.
|Date of Award||23 Jun 2020|
- The University of Bristol
|Supervisor||Peter J Green (Supervisor) & Andrew R Booker (Supervisor)|