RSA-130

From Wikipedia, the free encyclopedia

In mathematics, RSA-130 is one of the RSA numbers, large semiprimes that are part of the RSA Factoring Challenge. It was factored on April 10, 1996 by a team led by Arjen K. Lenstra and comprised of Jim Cowie, Marije Elkenbracht-Huizing, Wojtek Furmanski, Peter L. Montgomery, Damian Weber and Joerg Zayer.

The factorization of RSA-130 is as follows:

RSA-130 = 18070820886874048059516561644059055662781025167694013491701270214
          50056662540244048387341127590812303371781887966563182013214880557

RSA-130 = 39685999459597454290161126162883786067576449112810064832555157243
        * 45534498646735972188403686897274408864356301263205069600999044599

The factorisation was found using the Number Field Sieve algorithm and the polynomial

   5748302248738405200 x5 +  9882261917482286102 x4 
- 13392499389128176685 x3 + 16875252458877684989 x2
+  3759900174855208738 x1 - 46769930553931905995

which has a root of 12574411168418005980468 modulo RSA-130.

[edit] External links

This cryptography-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../r/s/a/RSA-130_21c0.html"
In other languages