2020/07/02 by Barry van Leeuwen, van Leeuwen, Barry
Computer Science · Mathematics · #11N35 #11Y05 #11Y16 #Algebraic Geometry and Number Theory #Analytic Number Theory Research #Coding theory and cryptography #F.2.0 #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2007.02689
openalex publication_date 2020/07/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.