Computing modular correspondences for abelian varieties
From MaRDI portal
Publication:661914
DOI10.1016/j.jalgebra.2011.06.031zbMath1247.14046arXiv0910.4668OpenAlexW1986410101MaRDI QIDQ661914
Jean-Charles Faugère, Damien Robert, David Lubicz
Publication date: 11 February 2012
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.4668
Related Items (4)
Computing isogenies between abelian varieties ⋮ Minimal integral models for principal series Weil characters ⋮ Computing separable isogenies in quasi-optimal time ⋮ Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Solving zero-dimensional algebraic systems
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- The Magma algebra system. I: The user language
- Ideal basis and primary decompositions: case of two variables
- Counting points on elliptic curves over finite fields
- On the equations defining Abelian varieties. I-III
- A p-Adic Quasi-Quadratic Time Point Counting Algorithm
- Linear Systems on Abelian Varieties
- Efficient Pairing Computation with Theta Functions
- Varieties Defined by Quadratic Equations
- FGb: A Library for Computing Gröbner Bases
- Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Computing modular correspondences for abelian varieties
