Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Factoring estimates for a 1024-bit RSA modulus
 
conference paper

Factoring estimates for a 1024-bit RSA modulus

Tromer, E.
•
Shamir, A.
•
Kortsmit, W.
Show more
2003
Advances In Cryptology - Asiacrypt 2003
9th International Conference on the Theory and Application of Cryptology and Information Security

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].

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

NPDF-30.pdf

Access type

openaccess

Size

232.7 KB

Format

Adobe PDF

Checksum (MD5)

8e10aee82b0f2be866568602a58d8c94

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés