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

Optimisation of discrete logarithms #136

Open
b-mehta opened this issue Sep 12, 2018 · 0 comments
Open

Optimisation of discrete logarithms #136

b-mehta opened this issue Sep 12, 2018 · 0 comments

Comments

@b-mehta
Copy link
Contributor

b-mehta commented Sep 12, 2018

Continuing work and discussion from #130, it would be nice to both optimise Pollard's algorithm further using more sophisticated walks and possibly use the Pollig-Hellman algorithm in some cases. See TODO comments in Math.NumberTheory.Moduli.DiscreteLogarithm.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@b-mehta