Fast genus 2 arithmetic based on Theta functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Mathematical Cryptology Year : 2007

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 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.
Fichier principal
Vignette du fichier
arithKsurf.pdf (190.55 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission

Dates and versions

inria-00000625 , version 1 (10-11-2005)
inria-00000625 , version 2 (20-08-2007)



Pierrick Gaudry. Fast genus 2 arithmetic based on Theta functions. Journal of Mathematical Cryptology, 2007, 1 (3), pp.243-265. ⟨10.1515/JMC.2007.012⟩. ⟨inria-00000625v2⟩
279 View
853 Download



Gmail Facebook X LinkedIn More