Skip to content

Commit

Permalink
PollardRhoBrentMontgomery64* variants now work for 63 bit, too
Browse files Browse the repository at this point in the history
  • Loading branch information
@TilmanNeumann
TilmanNeumann committed Feb 1, 2025
1 parent 9220446 commit 7878138
Showing 1 changed file with 1 addition and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ It provides some pretty fast implementations of various factoring algorithms, in
* HartFast2Mult: Highly optimized "Hart's one-line factorizer" for numbers <= 62 bit
* LehmanFast, LehmanCustomKOrder: Fast Lehman implementations for numbers <= 62 bit
* SquFoF31Preload, SquFoF63: SquFoF implementations for numbers <= 52 rsp. 90 bit
* PollardRhoBrentMontgomery64MHInlined: Highly optimized Pollard-Rho for numbers <= 62 bit.
* PollardRhoBrentMontgomery64MHInlined: Highly optimized Pollard-Rho for numbers <= 63 bit.
* TinyEcm64MHInlined: Java version of YaFu's fast tinyEcm.c for numbers <= 62 bit.
* CFrac63, CFrac: CFrac implementations working on longs rsp. BigIntegers internally.
* SIQS: Single-threaded self-initializing quadratic sieve (SIQS).
Expand Down

0 comments on commit 7878138

Please sign in to comment.