3,785 research outputs found
Root optimization of polynomials in the number field sieve
The general number field sieve (GNFS) is the most efficient algorithm known
for factoring large integers. It consists of several stages, the first one
being polynomial selection. The quality of the chosen polynomials in polynomial
selection can be modelled in terms of size and root properties. In this paper,
we describe some algorithms for selecting polynomials with very good root
properties.Comment: 16 pages, 18 reference
Levels of Distribution and the Affine Sieve
This article is an expanded version of the author's lecture in the Basic
Notions Seminar at Harvard, September 2013. Our goal is a brief and
introductory exposition of aspects of two topics in sieve theory which have
received attention recently: (1) the spectacular work of Yitang Zhang, under
the title "Level of Distribution," and (2) the so-called "Affine Sieve,"
introduced by Bourgain-Gamburd-Sarnak.Comment: 34 pages, 2 figure
Artin's primitive root conjecture -a survey -
This is an expanded version of a write-up of a talk given in the fall of 2000
in Oberwolfach. A large part of it is intended to be understandable by
non-number theorists with a mathematical background. The talk covered some of
the history, results and ideas connected with Artin's celebrated primitive root
conjecture dating from 1927. In the update several new results established
after 2000 are also discussed.Comment: 87 pages, 512 references, to appear in Integer
- …