Just as a test, I factored the RSA-100 using GNFS. I used the program GGNFS.
1min 30secs=Polynomial Selection
Resulting polynomials: g(x)=17373459690773-1486274917912119805015523x,
f(x)=14175976462260376107850436700-11578483843110807572817x-9011290343227090x^2+2217037424x^3+312x^4
38min 11secs=Finding Relations
4220645 relations found
2min 49secs=Filtering
2min 39secs=Linear Algebra
Matrix size: 214442*214671
31secs=Square Root
Initial square root was modulo 396264653
Result:
37975227936943673922808872755445627854565536638199*
40094690950920881030683735292761468389214899724061
Detailed info of the factorization can be found in the attached file.
RSA100-gnfs
.txt
Download TXT • 33KB