A generic approach to searching for Jacobians
From MaRDI portal
Publication:3055104
DOI10.1090/S0025-5718-08-02143-1zbMath1208.14020arXiv0708.3168MaRDI QIDQ3055104
Publication date: 7 November 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0708.3168
Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Zeta and (L)-functions in characteristic (p) (11M38)
Related Items
Genus 2 point counting over prime fields, Counting points on genus-3 hyperelliptic curves with explicit real multiplication, Computing -series of geometrically hyperelliptic curves of genus three, Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields, Counting points on smooth plane quartics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Factoring integers with elliptic curves
- The Pohlig-Hellman method generalized for group structure computation
- Constructive and destructive facets of Weil descent on elliptic curves
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Counting points on elliptic curves over finite fields
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- Explicit bounds and heuristics on class numbers in hyperelliptic function fields
- A Monte Carlo Factoring Algorithm With Linear Storage
- Modular Multiplication Without Trial Division
- A double large prime variation for small genus hyperelliptic index calculus
- Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng
- Fast addition on non-hyperelliptic genus 3 curves
- Asymptotically fast group operations on Jacobians of general curves
- Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
- Computing in the Jacobian of a Hyperelliptic Curve
- A space efficient algorithm for group structure computation
- On some computational problems in finite abelian groups
- Counting Points in Medium Characteristic Using Kedlaya's Algorithm
- Asymptotic semismoothness probabilities
- Constructing hyperelliptic curves of genus 2 suitable for cryptography
- The arithmetic of Jacobian groups of superelliptic cubics
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- Advances in Cryptology - EUROCRYPT 2004
- Computing the structure of a finite abelian group
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Kedlaya's Algorithm in Larger Characteristic
- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
- Algorithmic Number Theory
- Algorithmic Number Theory
- Selected Areas in Cryptography
- Numbers of solutions of equations in finite fields
- Algorithmic Number Theory
- Public Key Cryptography – PKC 2004
- Advances in Cryptology - ASIACRYPT 2003
- Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
