An Efficient Polynomial Multiplier in GF(2m) and its Application to ECC Designs
This paper discusses approaches that allow constructing efficient polynomial multiplication units. Such multipliers are the most important components of ECC hardware accelerators. The proposed hRAIK multiplication improves energy consumption, the longest path, and required silicon area compared to s...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper discusses approaches that allow constructing efficient polynomial multiplication units. Such multipliers are the most important components of ECC hardware accelerators. The proposed hRAIK multiplication improves energy consumption, the longest path, and required silicon area compared to state of the art approaches. The authors use such a core multiplier to construct an efficient sequential polynomial multiplier based on the known iterative Karatsuba method. Finally, the authors exploit the beneficial properties of the design to build an ECC accelerator. The design for GF(2 233 ) requires about 1.4 mm 2 cell area in a 0.25mum technology and needs 80 musec for an EC point multiplication |
---|---|
ISSN: | 1530-1591 1558-1101 |
DOI: | 10.1109/DATE.2007.364469 |