🚀 go-pugleaf

In article <PC123.93Jan22192804@bootes.cus.cam.ac.uk> pc123@cus.cam.ac.uk (Pete Chown) writes:
:In article <1993Jan22.013643.10520@linus.mitre.org> bs@gauss.mitre.org (Robert D. Silverman) writes:
:
:   The Number Field Sieve [on some reasonable unproved assumptions] takes
:   exp( (c + o(1))  (log N)^1/3  (log log N)^2/3)
:   with c ~ 1.91
:
:Does anyone have a reference for any articles or books on the number
:field sieve?  I would quite like to see how they have done it.
					     ^^^^           ^^

The antecedent of the pronoun "they" is unclear to me. To whom do
you refer? And what is "it"? Derived the asymptotic run time? Or
are you asking how the algorithm works?
 
I gave a reference in the bibliography I just posted. The paper 
assumes quite a lot of background in algebraic number theory and
knowledge of the quadratic sieve [they do not explain sieving
procedures]. It also assumes you know a lot of general techniques
in computational number theory, e.g. the Cantor-Zassenhaus method
for factoring polynomials modulo primes, etc. etc. It is a really
excellent paper, but novices will have a rough time with it.
--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"