On the evaluation of modular polynomials
From MaRDI portal
Publication:2949511
DOI10.2140/obs.2013.1.531zbMath1344.11087arXiv1202.3985OpenAlexW3106357642WikidataQ64387960 ScholiaQ64387960MaRDI QIDQ2949511
Publication date: 1 October 2015
Published in: The Open Book Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3985
Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Complex multiplication and moduli of abelian varieties (11G15)
Related Items (8)
Practical isogeny-based key-exchange with optimal tightness ⋮ Computational Number Theory, Past, Present, and Future ⋮ Accelerating the Delfs-Galbraith algorithm with fast subfield root detection ⋮ New examples of maximal curves with low genus ⋮ Constructing cycles in isogeny graphs of supersingular elliptic curves ⋮ Computing modular polynomials and isogenies of rank two Drinfeld modules over finite fields ⋮ Improved supersingularity testing of elliptic curves ⋮ Polynomials Defining Teichmüller Curves and Their Factorizations mod p
Uses Software
This page was built for publication: On the evaluation of modular polynomials
