diff options
| author | Jack Lloyd <[email protected]> | 2018-08-23 04:36:17 -0400 |
|---|---|---|
| committer | Jack Lloyd <[email protected]> | 2018-08-23 04:36:17 -0400 |
| commit | 1cec02b13cb2794894423090155e5090cdc93104 (patch) | |
| tree | d07628535dacb8a0a6201077d194b9371c2039b8 /doc | |
| parent | 42685cbf283aab8ca1d6c3c9975e883d9c262b3a (diff) | |
Correct statement of factor's reach
Rho would have some trouble with a 150 bit RSA semiprimes
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/manual/cli.rst | 2 |
1 files changed, 1 insertions, 1 deletions
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. |