Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
HECC Goes Embedded: An Area-Efficient Implementation of HECC
verfasst von : Junfeng Fan, Lejla Batina, Ingrid Verbauwhede
Erschienen in: Selected Areas in Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper we describe a high performance, area-efficient implementation of Hyperelliptic Curve Cryptosystems over GF(2
m
). A compact Arithmetic Logic Unit (ALU) is proposed to perform multiplication and inversion. With this ALU, we show that divisor multiplication using affine coordinates can be efficiently supported. Besides, the required throughput of memory or Register File (RF) is reduced so that area of memory/RF is reduced. We choose hyperelliptic curves using the parameters
h
(
x
) =
x
and
$f(x)=x^5+f_3x^3+x^2+f_0$
. The performance of this coprocessor is substantially better than all previously reported FPGA-based implementations. The coprocessor for HECC over GF(2
83
) uses 2316 slices and 2016 bits of Block RAM on Xilinx Virtex-II FPGA, and finishes one scalar multiplication in 311
μs
.