Go Back   EXETOOLS FORUM > General > General Discussion


Thread Tools Display Modes
Old 01-04-2005, 18:22
suddenLy suddenLy is offline
Join Date: Jan 2005
Posts: 60
Rept. Given: 2
Rept. Rcvd 3 Times in 3 Posts
Thanks Given: 1
Thanks Rcvd at 0 Times in 0 Posts
suddenLy Reputation: 3
Any fast factorizing program?

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
Reply With Quote
Old 01-05-2005, 22:37
Posts: n/a
Here are some utils for factoring

Reply With Quote
Old 01-05-2005, 23:39
hosiminh hosiminh is offline
Join Date: Aug 2004
Posts: 203
Rept. Given: 2
Rept. Rcvd 1 Time in 1 Post
Thanks Given: 0
Thanks Rcvd at 0 Times in 0 Posts
hosiminh Reputation: 1

Factorization using the Elliptic Curve Method
Reply With Quote
Old 01-06-2005, 11:40
Posts: n/a
Take a look at this tool which uses General Number Field Sieve.
I havn't tried it yet. RSATool has been enough for me for the present.
Reply With Quote
Old 01-06-2005, 14:35
Posts: n/a
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.
Reply With Quote
Old 01-06-2005, 15:05
Posts: n/a
Question TWIRL Device Maybe ?

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



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:
Reply With Quote
Old 01-06-2005, 17:49
Posts: n/a
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.

Last edited by arkanoid; 01-06-2005 at 21:56.
Reply With Quote

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is Off
HTML code is Off

Similar Threads
Thread Thread Starter Forum Replies Last Post
MD5 Fast Collision CodeCracker Community Tools 5 09-04-2018 14:54
Fast Universal Unpacker v0.1 Mahmoudnia Source Code 0 08-29-2014 15:37
what is fast android simulator. newyzy General Discussion 7 11-06-2013 01:04

All times are GMT +8. The time now is 06:58.

Always Your Best Friend: Aaron, JMI, ahmadmansoor, ZeNiX