
Home
Search Site Largest Finding How Many? Mersenne Glossary Prime Curios! email list FAQ Prime Lists Titans Submit primes 
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 ] Item(s) in original BibTeX format@unpublished{Bernstein2001, author={D. Bernstein}, title={Circuits for integer factorization: a proposal}, abstract={The number field sieve takes time $L^{1.901\cdots+o(1)}$ on a general purpose computer with $L^{0:950\cdots+o(1)}$ bits of memory; here $L$ is a particular subexponential function of the input size. It takes the same time on a parallel trialdivision machine, such as Cracker or TWINKLE, of size $L^{0.950\cdots+o(1)}$. It takes time only $L^{1.185\cdots+o(1)}$ on a machine of size $L^{0.790\cdots+o(1)}$ explained in this paper. This reduction of total cost from $L^{2.852\cdots+o(1)}$ to $L^{1.976\cdots+o(1)}$ means that a $((3:009\cdots +o(1))d)$digit factorization with the new machine has the same cost as a $d$digit factorization with previous machines. }, note={Available from \url{http://cr.yp.to/factorization.html}}, year={2001} } 
Another prime page by Chris K. Caldwell 