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.
No takes yet. Share an insight, caveat, or question.
Pierrick Gaudry (2007) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: