Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields

From MaRDI portal
Publication:5202279

DOI10.2307/2008445zbMath0724.11070OpenAlexW4251630068MaRDI QIDQ5202279

Jonathan Pila

Publication date: 1990

Full work available at URL: https://doi.org/10.2307/2008445




Related Items (50)

Fast cryptography in genus 2Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝On the analogue of the division polynomials for hyperelliptic curves.Rigid cohomology and \(p\)-adic point countingModular equations for hyperelliptic curvesPoint counting on Picard curves in large characteristicA quasi quadratic time algorithm for hyperelliptic curve point countingUnivariate polynomial factorization over finite fieldsHilbert modular polynomialsApproximating Euler products and class number computation in algebraic function fieldsComputing the endomorphism ring of an ordinary abelian surface over a finite fieldImproved complexity bounds for counting points on hyperelliptic curvesGenus 2 point counting over prime fieldsOn the discrete logarithm problem for plane curvesEfficient computation of Cantor's division polynomials of hyperelliptic curves over finite fieldsCounting points on genus-3 hyperelliptic curves with explicit real multiplicationComputing zeta functions of cyclic covers in large characteristicZeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomologyCounting points on hyperelliptic curves in average polynomial timeSato-Tate distributionsON THE DISTRIBUTION OF ORDERS OF FROBENIUS ACTION ON ^-TORSION OF ABELIAN SURFACESCounting curves and their projectionsCounting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemesA deterministic test for permutation polynomialsAlgorithms for modular counting of roots of multivariate polynomialsCounting points on curves and Abelian varieties over finite fieldsComputing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential timeUnnamed ItemA generic approach to searching for JacobiansIndex calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problemQuantum algorithms for algebraic problemsOn the discrete logarithm problem in class groups of curvesGenerating Genus Two Hyperelliptic Curves over Large Characteristic Finite FieldsDivision polynomials for hyperelliptic curves defined by Dickson polynomialsCounting points on hyperelliptic curves with explicit real multiplication in arbitrary genusIndex calculus in class groups of non-hyperelliptic curves of genus threeA Point Counting Algorithm Using Cohomology with Compact SupportUsing zeta functions to factor polynomials over finite fieldsEquations for the Jacobian of a hyperelliptic curveComputing endomorphism rings of abelian varieties of dimension twoA double large prime variation for small genus hyperelliptic index calculusCounting points on hyperelliptic curves of genus 2 with real models2-adic point counting on \(K3\) surfacesA Recursive Method for Computing Zeta Functions of VarietiesComputing zeta functions of algebraic curves using Harvey's trace formulaCounting points on smooth plane quarticsAbeliants and their application to an elementary construction of Jacobians.Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomologyComputing 𝐿-polynomials of Picard curves from Cartier–Manin matrices




This page was built for publication: Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields