Number Field Sieve with provable complexity

  • Barry Van Leeuwen

Student thesis: Master's ThesisMaster of Science (MSc)

Abstract

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 Award23 Jun 2020
Original languageEnglish
Awarding Institution
  • The University of Bristol
SupervisorPeter J Green (Supervisor) & Andrew R Booker (Supervisor)

Cite this

'