-
-
Notifications
You must be signed in to change notification settings - Fork 734
add Rémy Oudompheng's implementation of the BMSS algorithm #36285
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.
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
Conversation
Co-authored-by: Rémy Oudompheng <[email protected]>
|
The achievement is impressive. I made one comment. Otherwise, lgtm. |
kwankyu
left a comment
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
kwankyu approved this PR
|
Thanks for taking care of this. Please note that this algorithm requires that field characteristic is "large enough" ( |
|
merge conflict |
SageMath version 10.2.beta4, Release Date: 2023-09-24
|
Resolved merge conflict and added some new code to fail more gracefully when the limitation mentioned in #36285 (comment) is encountered. |
|
Documentation preview for this PR (built with commit 81996bb; changes) is ready! 🎉 |
…gorithm The BMSS algorithm computes (the kernel polynomial of) a *normalized* isogeny from its degree $\ell$ and its domain and codomain in time $\widetilde O(\ell)$. Currently Sage uses Stark's algorithm for the same task, which takes time in $\Omega(\ell^2)$. An implementation in Sage of the BMSS algorithm is available thanks to @remyoudompheng, and in this patch we add it to the Sage library (following Rémy's suggestion). Benchmark results for isogenies over a ~280-bit prime field (red is Stark, blue is BMSS; axes are degree $\ell$ and seconds taken):  URL: sagemath#36285 Reported by: Lorenz Panny Reviewer(s): github-actions[bot], Kwankyu Lee, Lorenz Panny
sagemathgh-36285: add Rémy Oudompheng's implementation of the BMSS algorithm The BMSS algorithm computes (the kernel polynomial of) a *normalized* isogeny from its degree $\ell$ and its domain and codomain in time $\widetilde O(\ell)$. Currently Sage uses Stark's algorithm for the same task, which takes time in $\Omega(\ell^2)$. An implementation in Sage of the BMSS algorithm is available thanks to @remyoudompheng, and in this patch we add it to the Sage library (following Rémy's suggestion). Benchmark results for isogenies over a ~280-bit prime field (red is Stark, blue is BMSS; axes are degree $\ell$ and seconds taken):  URL: sagemath#36285 Reported by: Lorenz Panny Reviewer(s): github-actions[bot], Kwankyu Lee, Lorenz Panny
The BMSS algorithm computes (the kernel polynomial of) a normalized isogeny from its degree$\ell$ and its domain and codomain in time $\widetilde O(\ell)$ . Currently Sage uses Stark's algorithm for the same task, which takes time in $\Omega(\ell^2)$ . An implementation in Sage of the BMSS algorithm is available thanks to @remyoudompheng, and in this patch we add it to the Sage library (following Rémy's suggestion).
Benchmark results for isogenies over a ~280-bit prime field (red is Stark, blue is BMSS; axes are degree$\ell$ and seconds taken):