Fast computation of elliptic curve isogenies in characteristic two
From MaRDI portal
Publication:5034139
DOI10.1112/jlms.12487zbMath1492.11106arXiv2003.06367OpenAlexW3186191061MaRDI QIDQ5034139
Elie Eid, Xavier Caruso, Reynald Lercier
Publication date: 24 February 2022
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.06367
Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05) Algebraic number theory: local fields (11S99) Computational number theory (11Y99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- The Magma algebra system. I: The user language
- Fast computation of isomorphisms between finite fields using elliptic curves
- A faster pseudo-primality test
- Elliptic periods and primality proving
- Fast computation of canonical lifts of elliptic curves and its application to point counting.
- Counting points on elliptic curves over finite fields
- Complex multiplication structure of elliptic curves
- Computing the endomorphism ring of an ordinary elliptic curve over a finite field
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Elliptic periods for finite fields
- p-Adic Stability In Linear Algebra
- Tracking -adic precision
- On p-Adic Differential Equations with Separation of Variables
- Fast Polynomial Factorization and Modular Composition
- Fast algorithms for computing isogenies between elliptic curves
- The Arithmetic of Elliptic Curves
- Computing isomorphisms and embeddings of finite fields
- Fast construction of irreducible polynomials over finite fields
This page was built for publication: Fast computation of elliptic curve isogenies in characteristic two
