Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
From MaRDI portal
Publication:5202279
DOI10.2307/2008445zbMATH Open0724.11070OpenAlexW4251630068MaRDI QIDQ5202279FDOQ5202279
Authors: Jonathan Pila 
Publication date: 1990
Full work available at URL: https://doi.org/10.2307/2008445
Recommendations
rational pointspolynomial timeFrobenius endomorphismAbelian varieties over finite fieldsroots of unity mod palgorithm of Schoof
Analysis of algorithms and problem complexity (68Q25) Complex multiplication and moduli of abelian varieties (11G15) Varieties over finite and local fields (11G25) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15) Complex multiplication and abelian varieties (14K22)
Cited In (57)
- ON THE DISTRIBUTION OF ORDERS OF FROBENIUS ACTION ON ^-TORSION OF ABELIAN SURFACES
- Computing zeta functions of algebraic curves using Harvey's trace formula
- A double large prime variation for small genus hyperelliptic index calculus
- Sato-Tate distributions
- Abeliants and their application to an elementary construction of Jacobians.
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
- Frobenius finds non-monogenic division fields of abelian varieties
- Fast cryptography in genus 2
- Equations for the Jacobian of a hyperelliptic curve
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Genus 2 point counting over prime fields
- Counting curves and their projections
- Improved complexity bounds for counting points on hyperelliptic curves
- Counting points on curves and Abelian varieties over finite fields
- Counting points on hyperelliptic curves in average polynomial time
- A Recursive Method for Computing Zeta Functions of Varieties
- Computing base extensions of ordinary abelian varieties over finite fields
- Counting points on smooth plane quartics
- Computing endomorphism rings of abelian varieties of dimension two
- A point counting algorithm using cohomology with compact support
- Counting points on curves over finite fields
- Classe de conjugaison du Frobenius d'une variété abélienne sur un corps de nombres
- Progress in Cryptology - INDOCRYPT 2003
- Title not available (Why is that?)
- Computing square-free polarized abelian varieties over finite fields
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication
- Efficient computation of Cantor's division polynomials of hyperelliptic curves over finite fields
- Algorithms for modular counting of roots of multivariate polynomials
- Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields
- Point counting on Picard curves in large characteristic
- Univariate polynomial factorization over finite fields
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Approximating Euler products and class number computation in algebraic function fields
- An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field
- Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
- Rigid cohomology and \(p\)-adic point counting
- Using zeta functions to factor polynomials over finite fields
- Computing zeta functions of cyclic covers in large characteristic
- Using partial smoothness of \(p-1\) for factoring polynomials modulo \(p\)
- Hilbert modular polynomials
- A generic approach to searching for Jacobians
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- Counting points on hyperelliptic curves of genus 2 with real models
- On the discrete logarithm problem for plane curves
- On the discrete logarithm problem in class groups of curves
- Index calculus in class groups of non-hyperelliptic curves of genus three
- Computing the endomorphism ring of an ordinary abelian surface over a finite field
- A deterministic test for permutation polynomials
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology
- Division polynomials for hyperelliptic curves defined by Dickson polynomials
- On the analogue of the division polynomials for hyperelliptic curves.
- Computing \(L\)-polynomials of Picard curves from Cartier-Manin matrices
- 2-adic point counting on \(K3\) surfaces
- Modular equations for hyperelliptic curves
- Quantum algorithms for algebraic problems
This page was built for publication: Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202279)
