Automatic integer factoring for 310-digit decimal numbers -

is here software, capable of factoring 310-digit decimal integer number primes? there msieve, used 120-digit factoring, 310 digit greater max allowed number of 308-digit msieve.

ps: number factor have 2 prime factors, , p-1,p+1 , other easy , fast factoring methods fail.

update: seems ggnfs work , there python scripts automate factoring.

use lenstra's ec algorithm if it's not semiprime. otherwise use pomerance's nfs. introductions exist both of these "boxes." bet browse homepages of lenstra , pomerance, they're both @ exposition. or check out "number theory: programmers guide", mark herkommer. it's need, nothing more, , clear.

edit: although 1000 bit modulus may bit of stretch, assuming have conventional hardware.

edit: sure, additional links: http://tinyurl.com/herkamzon herkommer book.

a 1987 paper on ec factoring hendrik lenstra's homepage : factoring integers elliptic curves, ann. of math. 126, 649-673..

from vast net : a simple python source code above algorithm (which haven't proofread)

carl pomerance's homepage , relevant paper on number field sieve here

however, may find useful this narrative on sieve's development, or this exposition on quadratic version pomerance's page.

check out this site dedicated implementation of gnfs, recommend finding copy of herkommer book contains clear simple source code on few pages.

edit : consider running factoring across elastic compute cloud. hear guy overnight $75 per this wired article