Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
From MaRDI portal
Recommendations
- Fast Jacobian arithmetic for hyperelliptic curves of genus 3
- Improved divisor arithmetic on generic hyperelliptic curves
- scientific article; zbMATH DE number 1186974
- Empirical optimization of divisor arithmetic on hyperelliptic curves over \(\mathbb{F}_{2^m}\)
- Efficient reduction of large divisors on hyperelliptic curves
Cited in
(19)- Jacobian coordinates on genus 2 curves
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Comparison of scalar multiplication on real hyperelliptic curves
- Group law computations on Jacobians of hyperelliptic curves
- Rational points on certain families of symmetric equations
- Computing L-series of geometrically hyperelliptic curves of genus three
- Cryptographic aspects of real hyperelliptic curves
- The infrastructure of a global field of arbitrary unit rank
- Jacobian Versus Infrastructure in Split Hyperelliptic Curves
- Empirical optimization of divisor arithmetic on hyperelliptic curves over \(\mathbb{F}_{2^m}\)
- On the Jacobian Varieties of Picard Curves: Explicit Addition Law and Algebraic Structure
- HECC (hyperelliptic curve cryptography)
- Improved divisor arithmetic on generic hyperelliptic curves
- Representations of divisors on hyperelliptic curves and plane curves with quasi-toric relations
- Fast Jacobian arithmetic for hyperelliptic curves of genus 3
- Efficient computation of (3ⁿ,3ⁿ)-isogenies
- Efficient computation of \((2^n, 2^n)\)-isogenies
- Hyperelliptic curves and integer factorization
- Bisection and squares in genus 2
This page was built for publication: Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387609)
