Fast genus 2 arithmetic based on Theta functions

Fast genus 2 arithmetic based on Theta functions

In 1986, D. V. Chudnovsky and G. V. Chudnovsky proposed to use formulae coming from Theta functions for the arithmetic in Jacobians of genus 2 curves. We follow this idea and derive fast formulae for the scalar multiplication in the Kummer surface associated to a genus 2 curve, using a Montgomery la...

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematical cryptology Vol. 1; no. 3; pp. 243 - 265
Main Author: Gaudry P.
Format: Journal Article
Language:English
Published: De Gruyter 01-08-2007
Subjects:
explicit formulae
hyperelliptic curve cryptography
kummer surface
theta functions
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In 1986, D. V. Chudnovsky and G. V. Chudnovsky proposed to use formulae coming from Theta functions for the arithmetic in Jacobians of genus 2 curves. We follow this idea and derive fast formulae for the scalar multiplication in the Kummer surface associated to a genus 2 curve, using a Montgomery ladder. Our formulae can be used to design very efficient genus 2 cryptosystems that should be faster than elliptic curve cryptosystems in some hardware configurations.
ISSN:1862-2976
1862-2984
DOI:10.1515/JMC.2007.012