From 1cec02b13cb2794894423090155e5090cdc93104 Mon Sep 17 00:00:00 2001 From: Jack Lloyd Date: Thu, 23 Aug 2018 04:36:17 -0400 Subject: Correct statement of factor's reach Rho would have some trouble with a 150 bit RSA semiprimes --- doc/manual/cli.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'doc') diff --git a/doc/manual/cli.rst b/doc/manual/cli.rst index b3379abbd..e4e3cb9f6 100644 --- a/doc/manual/cli.rst +++ b/doc/manual/cli.rst @@ -206,7 +206,7 @@ Number Theory ``factor n`` Factor the integer *n* using a combination of trial division by small primes, and Pollard's Rho algorithm. - It can in reasonable time factor integers up to 150 bits or so. + It can in reasonable time factor integers up to 110 bits or so. ``gen_prime --count=1 bits`` Samples *count* primes with a length of *bits* bits. -- cgit v1.2.3