Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Consider Montgummary multiplication for Polard Rho #116

Open
oscardssmith opened this issue May 31, 2022 · 2 comments
Open

Consider Montgummary multiplication for Polard Rho #116

oscardssmith opened this issue May 31, 2022 · 2 comments
Labels
performance

Comments

@oscardssmith
Copy link
Member

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
Copy link

ndcroos commented Aug 8, 2023 •
edited
Loading

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

@oscardssmith
Copy link
Member Author

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

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
performance
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@oscardssmith @ndcroos