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.

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

Faster Kohel isogenies without bivariate polynomials #35370

Merged
merged 1 commit into from
Apr 13, 2023

Commits on Apr 7, 2023

  1. Faster Kohel isogenies without bivariate polynomials

    This patch accelerates computation of Kohel formulas by replacing
    internal bivariate polynomials k[x,y] by a tower of polynomial
    rings k[x][y].
    
    Because the y-coordinate of isogenies are always defined by
    a polynomial of y-degree 1, this is equivalent to working
    with a pair of univariate polynomials, which often have efficient
    representations especially over finite fields.
    
    The public API still exposes bivariate rational functions and is
    not modified.
    
    The resulting representation is several times faster.
    remyoudompheng committed Apr 7, 2023
    Configuration menu
    Copy the full SHA
    f6802e1 View commit details
    Browse the repository at this point in the history