Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations

DOI10.1007/978-3-540-77360-3_11MaRDI QIDQ5452254zbMATH OpenOpenAlexFDO

Authors Guang Gong, Xin-Xin Fan

Publication date 25 March 2008

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77360-3_11

zbMATH Keywords

Cantor's algorithmefficient implementationexplicit formulaeGenus 2 hyperelliptic curvesHarley's variant

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Formulae for arithmetic on genus 2 hyperelliptic curves
• Empirical optimization of divisor arithmetic on hyperelliptic curves over \(\mathbb{F}_{2^m}\)
• Explicit formulas for real hyperelliptic curves of genus 2 in affine representation
• Selected Areas in Cryptography
• Cryptographic Hardware and Embedded Systems - CHES 2004

Cites work

• A Survey of Fast Exponentiation Methods
• Computing in the Jacobian of a Hyperelliptic Curve
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• scientific article; zbMATH DE number 1643944 (Why is no real title available?)
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 1302866 (Why is no real title available?)
• scientific article; zbMATH DE number 1962162 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• scientific article; zbMATH DE number 4185800 (Why is no real title available?)
• Hyperelliptic cryptosystems
• Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
• 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
• The complexity of certain multi-exponentiation techniques in cryptography
• Trading inversions for multiplications in elliptic curve cryptography

Cited in

(15)

• Faster pairing computation on genus 2 hyperelliptic curves
• Jacobian coordinates on genus 2 curves
• Explicit endomorphism of the Jacobian of a hyperelliptic function field of genus 2 using base field operations
• Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
• Faster Halvings in Genus 2
• Empirical optimization of divisor arithmetic on hyperelliptic curves over \(\mathbb{F}_{2^m}\)
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Optimization of the arithmetic of the ideal class group for genus 4 hyperelliptic curves over projective coordinates
• Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation
• Algorithmic Number Theory
• Selected Areas in Cryptography
• Parallelizing explicit formula for arithmetic in the Jacobian of hyperelliptic curves
• Explicit formulas for real hyperelliptic curves of genus 2 in affine representation
• Explicit addition formulae on hyperelliptic curves of genus 2 for isogeny-based cryptography
• Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes

Describes a project that uses

Uses Software

• HECC

This page was built for publication: Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452254)