Fast computation of hyperelliptic curve isogenies in odd characteristic
EID, Elie
Institut de Recherche Mathématique de Rennes [IRMAR]
Lithe and fast algorithmic number theory [LFANT]
Institut de Recherche Mathématique de Rennes [IRMAR]
Lithe and fast algorithmic number theory [LFANT]
EID, Elie
Institut de Recherche Mathématique de Rennes [IRMAR]
Lithe and fast algorithmic number theory [LFANT]
< Leer menos
Institut de Recherche Mathématique de Rennes [IRMAR]
Lithe and fast algorithmic number theory [LFANT]
Idioma
en
Communication dans un congrès
Este ítem está publicado en
International Symposium on Symbolic and Algebraic Computation — ISSAC 2021, 2021-07-18, Virtual event. 2021p. 131-138
ACM
Resumen en inglés
Let p be an odd prime number and g ≥ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the ...Leer más >
Let p be an odd prime number and g ≥ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic numbers Qp. It relies on an efficient resolution, with a logarithmic loss of p-adic precision, of a first order system of differential equations.< Leer menos
Proyecto ANR
Centre de Mathématiques Henri Lebesgue : fondements, interactions, applications et Formation - ANR-11-LABX-0020
Orígen
Importado de HalCentros de investigación