Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
From MaRDI portal
Publication:4700202
DOI10.1090/S0025-5718-99-01081-9zbMath0963.11032OpenAlexW2035381368MaRDI QIDQ4700202
François Morain, Reynald Lercier
Publication date: 1 November 1999
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01081-9
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)
Related Items (4)
Fast algorithms for computing isogenies between elliptic curves ⋮ Remarks on the Schoof-Elkies-Atkin algorithm ⋮ Isogenies on twisted Hessian curves ⋮ Relations between certain power sums of elliptic modular forms in characteristic two
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring integers with elliptic curves
- The Hasse invariant and p-division points of an elliptic curve
- Counting points on elliptic curves over finite fields
- Seminar on complex multiplication. Seminar held at the Institute for Advanced Study, Princeton, N.J., 1957--58
- Endomorphisms of Abelian varieties over finite fields
- Calcul pratique des coefficients de Taylor d'une fonction algébrique
- Formal groups
- Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
- Elliptic Curves and Primality Proving
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Elliptic Curve Cryptosystems
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Fast Algorithms for Manipulating Formal Power Series
- Counting Points on Elliptic Curves Over F 2 m
- GFUN
- Shift-register synthesis and BCH decoding
This page was built for publication: Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm