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

DOI10.1007/978-3-540-77360-3_11zbMath1154.11347MaRDI QIDQ5452254

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

efficient implementation; Cantor's algorithm; explicit formulae; Genus 2 hyperelliptic curves; Harley's variant

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

11Y16: Number-theoretic algorithms; complexity

11G20: Curves over finite and local fields

Related Items

Jacobian coordinates on genus 2 curves

Uses Software

• HECC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperelliptic cryptosystems
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Trading inversions for multiplications in elliptic curve cryptography
• The complexity of certain multi-exponentiation techniques in cryptography
• Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ
• Computing in the Jacobian of a Hyperelliptic Curve
• A Survey of Fast Exponentiation Methods
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• 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