Cryptology ePrint Archive: Report 2004/029

Finding Optimum Parallel Coprocessor Design for Genus 2 Hyperelliptic Curve Cryptosystems

Guido Bertoni and Luca Breveglieri and Thomas Wollinger and Christof Paar

Abstract: Hardware accelerators are often used in cryptographic applications for speeding up the highly arithmetic-intensive public-key primitives, e.g. in high-end smart cards. One of these emerging and very promising public-key scheme is based on HyperElliptic Curve Cryptosystems (HECC). In the open literature only a few considerations deal with hardware implementation issues of HECC. Our contribution appears to be the first one to propose architectures for the latest findings in efficient group arithmetic on HEC. The group operation of HECC allows parallelization at different levels: bit-level parallelization (via different digit-sizes in multipliers) and arithmetic operation-level parallelization (via replicated multipliers). We investigate the trade-offs between both parallelization options and identify speed and time-area optimized configurations. We found that a coprocessor using a single multiplier (D = 8) instead of two or more is best suited. This coprocessor is able to compute group addition and doubling in 479 and 334 clock cycles, respectively. Providing more resources it is possible to achieve 288 and 248 clock cycles, respectively.

Category / Keywords: implementation /

Publication Info: hyperelliptic curve, hardware architecture, coprocessor, parallelism, genus 2

Date: received 4 Feb 2004

Contact author: bertoni at elet polimi it

Available format(s): PDF | BibTeX Citation

Note: Part of this work is included in a paper accepted for ITCC 2004 crypto track

Version: 20040205:073900 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]