-
-
Notifications
You must be signed in to change notification settings - Fork 543
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
sparse strategies for composite elliptic-curve isogenies #34239
Milestone
Comments
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
|
Branch pushed to git repo; I updated commit sha1. This was a forced push. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Removed branch from the issue description because it has been replaced by PR #34965 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Some cryptographic applications (most prominently, https://sike.org/) rely on computing isogenies of huge prime-power degrees quickly. The current algorithm used for this in Sage (since #32744) is quadratic in the number of prime-degree steps. It is known from the SIKE literature how to do better, replacing quadratic by quasilinear scaling.
This patch implements a simple version of the quasilinear algorithm. I haven't found any example where the change incurs a noticeable slowdown, while (as shown below) there can be quite significant speedups.
Example:
Sage 9.7.beta6:
This branch:
CC: @defeo @JohnCremona @categorie
Component: elliptic curves
Author: Lorenz Panny
Issue created by migration from https://trac.sagemath.org/ticket/34239
The text was updated successfully, but these errors were encountered: