Factoring Estimates for a 1024-Bit RSA Modulus

@inproceedings{Lenstra2003FactoringEF,
  title={Factoring Estimates for a 1024-Bit RSA Modulus},
  author={Arjen K. Lenstra and Eran Tromer and Adi Shamir and Wil Kortsmit and Bruce Dodson and James P. Hughes and Paul C. Leyland},
  booktitle={ASIACRYPT},
  year={2003}
}
We estimate the yield of the number field sieve factoring algorithm when applied to the 1024-bit composite integer RSA-1024 and the parameters as proposed in the draft version [17] of the TWIRL hardware factoring device [18]. We present the details behind the resulting improved parameter choices from [18]. 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
37 Extracted Citations
14 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 37 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

Circuits for integer factorization: a proposal, manuscript, November 2001; available at http://cr.yp.to/papers.html#nfscircuit

  • D. J. Bernstein
  • 2001
Highly Influential
4 Excerpts

Improved polynomial selection for the number field sieve, extended abstract for the conference on the mathematics of public-key cryptography

  • P. L. Montgomery, B. Murphy
  • The Fields institute,
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…