Number Field Sieve with Provable Complexity
From MaRDI portal
Publication:6344486
arXiv2007.02689MaRDI QIDQ6344486FDOQ6344486
Publication date: 2 July 2020
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)
