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

Tonelli–Shanks algorithm implementation #261

Open
nemothenoone opened this issue Jul 19, 2020 · 1 comment · May be fixed by #268
Open

Tonelli–Shanks algorithm implementation #261

nemothenoone opened this issue Jul 19, 2020 · 1 comment · May be fixed by #268

Comments

@nemothenoone
Copy link
Contributor

nemothenoone commented Jul 19, 2020 •
edited
Loading

One more question about if something will be welcomed. Tonelli-Shanks algorithm?

In my vision it belongs to Boost.Multiprecision because it requires for the modular adaptor and Jacobi symbol computation to be used, which is impossible to do from Boost.Integer without introducing the dependency on the Boost.Multiprecision.
@NAThompson
Copy link
Contributor

I will gladly review a Tonelli-Shanks implementation, wherever it eventually goes.

@nemothenoone nemothenoone linked a pull request Sep 1, 2020 that will close this issue
Open
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

Successfully merging a pull request may close this issue.

Tonelli–Shanks algorithm implementation NilFoundation/boost-multiprecision
2 participants
@nemothenoone @NAThompson