Daniel J. Bernstein  Home/Search
Context Related
| cr.yp.to/papers/nfscircuit.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cr.yp.to/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The number eld sieve takes time L 1:901+o(1) on a generalpurpose computer with L 0: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 L 0:950+o(1) . It takes time only L 1:185+o(1) on a machine of size L 0:790+o(1) explained in this paper. This reduction of total cost from L 2:852+o(1) to L 1:976+o(1) means that a... (Update)
Cited by: More
Parallel Solution of Sparse Linear Systems Defined over GF(p) - Page (Correct)
Index Calculus in Class Groups of Plane Curves of Small Degree - Diem (2005) (Correct)
A Survey of Public-Key Cryptosystems - Koblitz, Menezes (Correct)
Active bibliography (related documents): More All
1.2: Kronecker Matrices and Polynomial Gcds - Bernstein (Correct)
0.9: How To Find Small Factors Of Integers - Bernstein (2000) (Correct)
0.7: Fast Multiplication And Its Applications - Bernstein (Correct)
Similar documents based on text: More All
0.1: Factoring Large Numbers with the TWINKLE Device (Extended Abstract) - Shamir (Correct)
0.0: Displaying Confidence Images - Nagy, O'Leary (2000) (Correct)
0.0: Phantom - A Language Overview - Courtney (1995) (Correct)
Related documents from co-citation: More All
5: Analysis of Bernstein 's factorization circuit - Lenstra, Shamir et al. - 2002
4: Factorization of a 512-bit RSA modulus - Cavallar, Dodson et al. - 2000
4: Factoring Large Numbers with the TWIRL Device - Shamir, Tromer - 2003
BibTeX entry: (Update)
D.J. Bernstein, Circuits for integer factorization: a proposal, manuscript, November 2001; available at cr.yp.to/papers.html#nfscircuit http://citeseer.ist.psu.edu/bernstein01circuits.html More
@misc{ bernstein01circuits,
author = "D. Bernstein",
title = "Circuits for integer factorization: a proposal",
text = "D.J. Bernstein, Circuits for integer factorization: a proposal, manuscript,
November 2001; available at cr.yp.to/papers.html#nfscircuit",
year = "2001",
url = "citeseer.ist.psu.edu/bernstein01circuits.html" }
Citations (may not include all citations):249 volume 3: sorting and searching (context) - Knuth, of et al. - 1998
134 Factoring integers with elliptic curves (context) - Lenstra - 1987
79 Sorting on a mesh-connected parallel computer (context) - Thompson, Kung - 1977
73 Fast solution of Toeplitz systems of equations and computati.. (context) - Brent, Gustavson et al. - 1980
72 An optimal sorting algorithm for mesh-connected computers (context) - Schnorr, Shamir - 1986
37 Analysis and comparison of some integer factoring algorithms (context) - Pomerance - 1982
21 Computational aspects of discrete logarithms (context) - Lambert
20 A cost-based security analysis of symmetric and asymmetric k.. (context) - Silverman - 2000
17 Distributed matrix-free solution of large sparse linear syst.. - Kaltofen, Lobo
10 Fast computation of GCDs (context) - Moenck - 1973
8 Schnelle Berechnung von Kettenbruchentwicklugen (context) - Sch - 1971
8 Analysis and optimization of the TWINKLE factoring device (context) - Lenstra, Shamir - 2000
7 Modications to the number eld sieve (context) - Coppersmith - 1993
5 Computational methods in number theory (context) - Lenstra, Robert et al. - 1982
5 Philosophical Transactions of the Royal Society of London Se.. (context) - Lenstra, Jonathan et al. - 1993
3 An FFT extension of the ellpitic curve method of factorizati.. (context) - Montgomery - 1992
2 Association for Computing Machinery (context) - Aho, Conference et al. - 1973
2 54-62 (context) - Wiedemann, linear et al. - 1986
1 Fast sorting on the instruction systolic array (context) - Schimmler - 1987
http://cr.yp.to/papers.html
Documents on the same site (http://cr.yp.to/papers.html): More
How To Find Small Factors Of Integers - Bernstein (2000) (Correct)
Factoring into Coprimes in Essentially Linear Time - Bernstein (Correct)
A Secure Public-Key Signature System With Extremely Fast.. - Bernstein (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC