Genus 2 point counting over prime fields
From MaRDI portal
Publication:412199
DOI10.1016/J.JSC.2011.09.003zbMATH Open1267.11127OpenAlexW2129089669MaRDI QIDQ412199FDOQ412199
Authors: Pierrick Gaudry, Éric Schost 
Publication date: 4 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.09.003
Recommendations
- Counting points for genus 2 hyperelliptic curves of two special types over finite fields
- Counting Points on Genus 2 Curves with Real Multiplication
- The probability that the number of points on the Jacobian of a genus 2 curve is prime
- The number of genus 2 covers of an elliptic curve
- On the number of curves of genus 2 over a finite field.
- Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication
- Integer Points on Curves of Genus 2 and their Jacobians
- scientific article; zbMATH DE number 2177420
- Counting points on elliptic curves over finite fields
- Counting points on hyperelliptic curves of genus 2 with real models
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Polynomial evaluation and interpolation on special sets of points
- Evaluating Polynomials at Fixed Sets of Points
- Solving zero-dimensional systems through the rational univariate representation
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Change of order for bivariate triangular sets
- Fast Algorithms for Manipulating Formal Power Series
- Title not available (Why is that?)
- Sharp estimates for triangular sets
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Fast genus 2 arithmetic based on Theta functions
- Public Key Cryptography - PKC 2006
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Fast computation of special resultants
- Modern computer algebra
- Computing Frobenius maps and factoring polynomials
- Title not available (Why is that?)
- Fast construction of irreducible polynomials over finite fields
- Counting points on curves over finite fields
- A new polynomial factorization algorithm and its implementation
- Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic
- Title not available (Why is that?)
- The canonical lift of an ordinary elliptic curve over a finite field and its point counting
- A generic approach to searching for Jacobians
- Modular Polynomials for Genus 2
- A Hyperelliptic Smoothness Test, II
- Counting (quickly) the number of solutions of equations in finite fields
- Title not available (Why is that?)
- On the analogue of the division polynomials for hyperelliptic curves.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deformation theory and the computation of zeta functions
- Modular equations for hyperelliptic curves
- Advances in Cryptology - EUROCRYPT 2004
- Kedlaya's Algorithm in Larger Characteristic
- Algorithmic Number Theory
- Fast construction of irreducible polynomials over finite fields
- Counting points on curves and Abelian varieties over finite fields
Cited In (39)
- The 2-adic valuation of the cardinality of Jacobians of genus 2 curves over quadratic towers of finite fields
- Computing zeta functions of algebraic curves using Harvey's trace formula
- Symbolic trisection polynomials for genus 2 curves in odd characteristic
- Kummer for genus one over prime-order fields
- Counting points on hyperelliptic curves of type \(y^2=x^{2g+1}+ax^{g+1}+bx\)
- Curves, Jacobians, and cryptography
- Taking roots over high extensions of finite fields
- Advances in Cryptology - EUROCRYPT 2004
- Fast cryptography in genus 2
- Point-counting algorithms for the Hecke operator and applications to modular curves of genus 4
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
- Title not available (Why is that?)
- Improved complexity bounds for counting points on hyperelliptic curves
- Counting points on hyperelliptic curves in average polynomial time
- Hash functions from superspecial genus-2 curves using Richelot isogenies
- On counting and generating curves over small finite fields
- Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication
- Counting points for genus 2 hyperelliptic curves of two special types over finite fields
- Computing in degree \(2^k\)-extensions of finite fields of odd characteristic
- Constructing abelian surfaces for cryptography via Rosenhain invariants
- Bisection and squares in genus 2
- ON THE DISTRIBUTION OF ORDERS OF FROBENIUS ACTION ON ^-TORSION OF ABELIAN SURFACES
- Jacobian coordinates on genus 2 curves
- Computing zeta functions of cyclic covers in large characteristic
- The probability that the number of points on the Jacobian of a genus 2 curve is prime
- Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time
- A generic approach to searching for Jacobians
- Counting points on hyperelliptic curves of genus 2 with real models
- Counting Points on Genus 2 Curves with Real Multiplication
- Computing isogenies from modular equations in genus two
- Trisection for genus 2 curves in odd characteristic
- Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers
- Zeta functions of nondegenerate hypersurfaces in toric varieties via controlled reduction in \(p\)-adic cohomology
- Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox
- Four\(\mathbb {Q}\)NEON: faster elliptic curve scalar multiplications on ARM processors
- Efficient arithmetic in (pseudo-)Mersenne prime order fields
- Hyper-and-elliptic-curve cryptography
- Genus numbers of cyclic and dihedral extensions of prime degree
Uses Software
This page was built for publication: Genus 2 point counting over prime fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412199)
