Group Law Computations on Jacobians of Hyperelliptic Curves
From MaRDI portal
Publication:2889865
DOI10.1007/978-3-642-28496-0_6zbMath1292.94049OpenAlexW1596013679MaRDI QIDQ2889865
Craig Costello, Kristin E. Lauter
Publication date: 8 June 2012
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28496-0_6
Related Items (10)
Fast cryptography in genus 2 ⋮ HECC (Hyperelliptic Curve Cryptography) ⋮ Jacobian coordinates on genus 2 curves ⋮ Bäcklund transformations for the nonholonomic Veselova system ⋮ A new twofold Cornacchia-type algorithm and its applications ⋮ Bäcklund transformations and divisor doubling ⋮ Jacobian Versus Infrastructure in Split Hyperelliptic Curves ⋮ Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems ⋮ Bäcklund transformations for the Jacobi system on an ellipsoid ⋮ Duffing Oscillator and Elliptic Curve Cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Public key cryptography -- PKC 2006. 9th international conference on theory and practice of public-key cryptography, New York, NY, USA, April 24--26, 2006. Proceedings.
- Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves
- Hyperelliptic cryptosystems
- Computing Riemann-Roch spaces in algebraic function fields and related topics.
- About the group law for the Jacobi variety of a hyperelliptic curve
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve
- Trading inversions for multiplications in elliptic curve cryptography
- An Analysis of Affine Coordinates for Pairing Computation
- Fast Jacobian Group Operations for C3,4 Curves over a Large Finite Field
- A double large prime variation for small genus hyperelliptic index calculus
- Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
- Fast addition on non-hyperelliptic genus 3 curves
- Asymptotically fast group operations on Jacobians of general curves
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Computing in the Jacobian of a Hyperelliptic Curve
- Elliptic Curve Cryptosystems
- Monte Carlo Methods for Index Computation (mod p)
- Linear algebra algorithms for divisors on an algebraic curve
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
- Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
- Fast genus 2 arithmetic based on Theta functions
- Some Improved Algorithms for Hyperelliptic Curve Cryptosystems Using Degenerate Divisors
- 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
- Public Key Cryptography - PKC 2006
- Algorithmic Number Theory
- Public Key Cryptography – PKC 2004
This page was built for publication: Group Law Computations on Jacobians of Hyperelliptic Curves
