High Performance Arithmetic for special Hyperelliptic Curve Cryptosystems of Genus Two

  • Authors:
  • Jan Pelzl;Thomas Wollinger;Christof Paar

  • Affiliations:
  • -;-;-

  • Venue:
  • ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Regarding the overall speed and power consumption,cryptographic applications in embedded environments likePDAs or mobile communication devices can benefit fromspecially designed cryptosystems with fixed parameters. Inthis contribution, we propose a highly efficient algorithm fora hyperelliptic curve cryptosystem (HECC) of genus two,well suited for these applications on constrained devices.This work presents a major improvement of HECC arithmeticfor certain non-supersingular curves defined overfields of characteristic two. We optimized the group doublingoperation and managed to speed up the whole cryptosystemby approximately 27% compared to the previouslyknown most efficient case. Furthermore, an actual implementationof the new formulae on an embedded processorshows its practical relevance. A scalar multiplication canbe performed in approximately 50ms on an 80MHz embedded device.