Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors

DOI10.1007/978-3-540-79456-1_23zbMath1232.14017DBLPconf/ants/GalbraithHM08OpenAlexW1521010921WikidataQ61914052 ScholiaQ61914052MaRDI QIDQ5387609

David J. Mireles Morales, Steven D. Galbraith, Michael C. Harrison

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79456-1_23

Mathematics Subject Classification ID

Jacobians, Prym varieties (14H40) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (13)

Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ HECC (Hyperelliptic Curve Cryptography) ⋮ Jacobian coordinates on genus 2 curves ⋮ Rational points on certain families of symmetric equations ⋮ Fast Jacobian arithmetic for hyperelliptic curves of genus 3 ⋮ Efficient computation of \((3^n,3^n)\)-isogenies ⋮ Constructing pairing-friendly hyperelliptic curves using Weil restriction ⋮ Computing -series of geometrically hyperelliptic curves of genus three ⋮ Jacobian Versus Infrastructure in Split Hyperelliptic Curves ⋮ Comparison of scalar multiplication on real hyperelliptic curves ⋮ Cryptographic aspects of real hyperelliptic curves ⋮ Bisection and squares in genus 2 ⋮ The infrastructure of a global field of arbitrary unit rank

Uses Software

• Magma

This page was built for publication: Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors