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

We study the distribution of the complex roots of random polynomials of degree n with i.i.d. coefficients. Using techniques related to Rice's treatment of the real roots question, we derive, under ...