Comments on: Factoring large integers: pollard p-1 method http://ardoino.com/9-maths-factoring-pollard/ Homo quisque faber ipse fortunae suae Tue, 06 Jan 2009 06:30:13 +0000 http://wordpress.org/?v=2.6.5 By: Fredi http://ardoino.com/9-maths-factoring-pollard/#comment-3970 Fredi Tue, 15 Jul 2008 07:21:59 +0000 http://ardoino.com/maths-factoring-pollard/#comment-3970 Its really nice and tricky code! http://www.roulettefind.com http://www.greatoverhead.com Its really nice and tricky code!

http://www.roulettefind.com
http://www.greatoverhead.com

]]> By: Paolo Ardoino http://ardoino.com/9-maths-factoring-pollard/#comment-2458 Paolo Ardoino Tue, 10 Jun 2008 07:27:43 +0000 http://ardoino.com/maths-factoring-pollard/#comment-2458 Hello, if a twenty digits length integer takes 22 seconds for its factorization I suppose that you could test it in on a 24, 26, 28, 30 digits to see if it is useful for your needs. Note that hardware has been improved from 3 years ago :) Hello,
if a twenty digits length integer takes 22 seconds for its factorization
I suppose that you could test it in on a 24, 26, 28, 30 digits to see if it is useful for your needs.

Note that hardware has been improved from 3 years ago :)

]]> By: kittu http://ardoino.com/9-maths-factoring-pollard/#comment-2345 kittu Sat, 07 Jun 2008 18:23:01 +0000 http://ardoino.com/maths-factoring-pollard/#comment-2345 hi , very thank ful to u ,for providing source code in detail may i know what is the maximum capacity of this code upto how many digits we can find factors using this method please reply me hi , very thank ful to u ,for providing source code in detail

may i know what is the maximum capacity of this code

upto how many digits we can find factors using this method

please reply me

]]>