Open AccessFlexible Prime‐Field Genus 2 Hyperelliptic Curve Cryptography Processor with Low Power Consumption and Uniform Power Draw
Author(s) -
Ahmadi HamidReza,
AfzaliKusha Ali,
Pedram Massoud,
Mosaffa Mahdi
Publication year - 2015
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.15.0114.0418
Subject(s) - hyperelliptic curve cryptography , scalar multiplication , hyperelliptic curve , prime power , mathematics , jacobian matrix and determinant , finite field , prime (order theory) , cryptography , divisor (algebraic geometry) , elliptic curve cryptography , prime factor , jacobian curve , genus , field (mathematics) , arithmetic , discrete mathematics , computer science , algorithm , elliptic curve , pure mathematics , encryption , public key cryptography , combinatorics , botany , biology , operating system
This paper presents an energy‐efficient (low power) prime‐field hyperelliptic curve cryptography (HECC) processor with uniform power draw. The HECC processor performs divisor scalar multiplication on the Jacobian of genus 2 hyperelliptic curves defined over prime fields for arbitrary field and curve parameters. It supports the most frequent case of divisor doubling and addition. The optimized implementation, which is synthesized in a 0.13 μm standard CMOS technology, performs an 81‐bit divisor multiplication in 503 ms consuming only 6.55 μJ of energy (average power consumption is 12.76 μW). In addition, we present a technique to make the power consumption of the HECC processor more uniform and lower the peaks of its power consumption.