CryptoDB
Fast genus 2 arithmetic based on Theta functions
Authors: | |
---|---|
Download: | |
Abstract: | 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. |
BibTeX
@misc{eprint-2005-12648, title={Fast genus 2 arithmetic based on Theta functions}, booktitle={IACR Eprint archive}, keywords={public-key cryptography /}, url={http://eprint.iacr.org/2005/314}, note={ gaudry@lix.polytechnique.fr 13033 received 7 Sep 2005}, author={P. Gaudry}, year=2005 }