This is the Prime Pages'
interface to our BibTeX database. Rather than being an exhaustive database,
it just lists the references we cite on these pages. Please let me know of any errors you notice.|
References: [ Home | Author index | Key index | Search ]
- D. Bernstein, "Circuits for integer factorization: a proposal," (2001) Available from http://cr.yp.to/factorization.html.
The number field sieve takes time L1.901...+o(1) on a general purpose computer with L0:950...+o(1) bits of memory; here L is a particular subexponential function of the input size. It takes the same time on a parallel trial-division machine, such as Cracker or TWINKLE, of size L0.950...+o(1). It takes time only L1.185...+o(1) on a machine of size L0.790...+o(1) explained in this paper. This reduction of total cost from L2.852...+o(1) to L1.976...+o(1) means that a ((3:009... +o(1))d)-digit factorization with the new machine has the same cost as a d-digit factorization with previous machines.