RSA-130

In Mathematical, RSA-130 is a Nombre RSA, i.e. a great number Semi-first which belongs to the Compétition of factorization RSA. It was factorized the April 10th 1996 by a team led by Arjen K. Lenstra and composed of Jim Cowie, Marije Elkenbracht-Huizing, Wojtek Furmanski, Peter L. Montgomery, Damian Weber and Joerg Zayer.

The factorization of RSA-130 is the following one:

RSA-130 = 18070820886874048059516561644059055662781025167694013491701270214 50056662540244048387341127590812303371781887966563182013214880557

RSA-130 = 39685999459597454290161126162883786067576449112810064832555157243 * 45534498646735972188403686897274408864356301263205069600999044599

The Factorization was found by using the algorithm called Crible of the bodies of numbers and the Polynôme

5748302248738405200 x⁵ + 9882261917482286102 x⁴ - 13392499389128176685 X ³ + 16875252458877684989 X ² + 3759900174855208738 x¹ - 46769930553931905995

who has a root of 12574411168418005980468 modulos RSA-130.

External bond

• Advertisement of the factorization of RSA-130 by Arjen K. Lenstra

Random links:

Freycenet-la-Cuche | Guillaume II (bishop of Albi) | Friedrich Georg Wilhelm von Struve | Yvo Jacquier | Claude Jamet | Parc_de_Roxborough,_le_Colorado

© 2007-2008 speedlook.com; article text available under the terms of GFDL, from fr.wikipedia.org