Factorization of RSA-140 Using the Number Field Sieve

نویسندگان

  • Stefania Cavallar
  • Bruce Dodson
  • Arjen K. Lenstra
  • Paul C. Leyland
  • Walter M. Lioen
  • Peter L. Montgomery
  • Brian Murphy
  • Herman J. J. te Riele
  • Paul Zimmermann
چکیده

On February 2, 1999, we completed the factorization of the 140–digit number RSA–140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The previous record was established on April 10, 1996 by the factorization of the 130–digit number RSA–130, also with the help of NFS. The amount of computing time spent on RSA–140 was roughly twice that needed for RSA–130, about half of what could be expected from a straightforward extrapolation of the computing time spent on factoring RSA–130. The speed-up can be attributed to a new polynomial selection method for NFS which will be sketched in this paper.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 Factorization of a 512 { bit RSA Modulus

On August 22, 1999, we completed the factorization of the 512{bit 155{digit number RSA{155 with the help of the Number Field Sieve factoring method (NFS). This is a new record for factoring general numbers. Moreover, 512{bit RSA keys are frequently used for the protection of electronic commerce|at least outside the USA|so this factorization represents a breakthrough in research on RSA{based sys...

متن کامل

Factorization of a 1061-bit number by the Special Number Field Sieve

I provide the details of the factorization of the Mersenne number 21061 − 1 by the Special Number Field Sieve. Although this factorization is easier than the completed factorization of RSA-768, it represents a new milestone for factorization using publicly available software.

متن کامل

Factoring Large Numbers with the TWINKLE

The current record in factoring large RSA keys is the factorization of a 465 bit (140 digit) number achieved in February 1999 by running the Number Field Sieve on hundreds of workstations for several months. This paper describes a novel factoring technique which is several orders of magnitude more e cient. It is based on a very simple handheld optoelectronic device which can analyse 100,000,000...

متن کامل

Notes in Computer Science 1807

This paper reports on the factorization of the 512–bit number RSA–155 by the Number Field Sieve factoring method (NFS) and discusses the implications for RSA.

متن کامل

Factorization of a 768-Bit RSA Modulus

This paper reports on the factorization of the 768-bit number RSA-768 by the number field sieve factoring method and discusses some implications for RSA.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999