Number Field Sieve with Provable Complexity

MaRDI QIDQ6344486zbMATH OpenFDO

Authors Barry Van Leeuwen

Publication date 2 July 2020

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Sieves (11N35)

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, 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.

This page was built for publication: Number Field Sieve with Provable Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344486)