search

JuliaMath / Primes.jl

Prime numbers in Julia
Other
99 stars 32 forks source link

Consider Montgummary multiplication for Polard Rho #116

Open oscardssmith opened 2 years ago

oscardssmith commented 2 years ago

idea comes from https://en.algorithmica.org/hpc/algorithms/factorization/. Lenstra will still be better for numbers larger than Int64, but getting extra speed is always nice.

ndcroos commented 1 year ago

Hi, I'd like to work on this issue.

oscardssmith commented 1 year ago

sounds great! I started implementing montgommary multiplication in https://github.com/JuliaMath/IntegerMathUtils.jl/pull/1 but never got it fully working. That's probably the first step.