Any fast factorizing program?

[suddenLy]

Hi all,

Could u recommend any fast factorizing program?

I tried RSA-256 with RSA-Tool 2,

it taked about 3 hours.

I think it's not bad.

But if u know other fast program, feel free to know me

Here are some utils for factoring

_ftp://ftp.loria.fr/pub/loria/eureca/tmp/GMP-ECM/ecm4c.exe.gz
_http://www.asahi-net.or.jp/~KC2H-MSM/cn/factor240.zip
_http://www.asahi-net.or.jp/~KC2H-MSM/cn/ppmpqs27.tar.gz
_http://www.asahi-net.or.jp/~KC2H-MSM/cn/ppmpqs28.zip
_http://www.asahi-net.or.jp/~KC2H-MSM/cn/p_1.zip
_http://www.asahi-net.or.jp/~KC2H-MSM/cn/ppsiqs11.zip
_http://www.boo.net/~jasonp/msieve.exe

[hosiminh]

Miracl
h**p://indigo.ie/~mscott/

Factorization using the Elliptic Curve Method
h**p://www.alpertron.com.ar/ECM

Take a look at this tool which uses General Number Field Sieve.
hxxp://www.math.ttu.edu/~cmonico/software/ggnfs/
I havn't tried it yet. RSATool has been enough for me for the present.

It looks like you need to know quite a bit of maths to successfully use ggnfs. Among out-of-the-box factorizers msieve seems to be the fastest. There were reports of people factoring 100 digit numbers (330 bits) in a matter of several days on single common PCs.

Interesting reading about the (hypothetical) TWIRL Hardware Factoring Device:

http://www.wisdom.weizmann.ac.il/~tromer/twirl/

http://www.wisdom.weizmann.ac.il/%7Etromer/papers/twirl.pdf

TWIRL (The Weizmann Institute Relation Locator) is an electronic device for factoring of large integers. It implements the sieving step of the Number Field Sieve integer factorization algorithm, which is in practice the most expensive step in factorization. TWIRL more efficient than previous designs by several orders of magnitude, due to high algorithmic parallelization combined with adaptation to technological hardware constraints. Although fairly detailed, the design remains hypothetical since the device has not been actually built. However, projected cost estimates suggest that if TWIRL is built using current VLSI technology, it will be possible to factor 1024-bit integers, and hence to break 1024-bit RSA keys, in 1 year at the cost of a few dozen million US dollars (or significantly less, if several integers are to be factored simultaneously).

Other links for reference:
http://www.crypto-world.com/FactorWorld.html

There's a script can be used for selecting polynomial.
Look inside the factLat.pl
I can't guarantee it's efficiency.
But you can find other polyselect programs in the google, I guess.
This is all I know about this program. I tested it working but didn't factorize any big number actually.