In this thesis we give an in-depth introduction to the General Number Field Sieve, as it was used by Buhler, Lenstra, and Pomerance, [17], 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, [14], 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 |
|---|
| Original language | English |
|---|
| Awarding Institution | |
|---|
| Supervisor | Peter Green (Supervisor) & Andrew R Booker (Supervisor) |
|---|
Number Field Sieve with provable complexity
Van Leeuwen, B. (Author). 23 Jun 2020
Student thesis: Master's Thesis › Master of Science by Research (MScR)