DocumentCode
2643667
Title
An Efficient Polynomial Multiplier in GF(2m) and its Application to ECC Designs
Author
Peter, Steffen ; Langendorfer, Peter
Author_Institution
IHP GmbH, Frankfurt
fYear
2007
fDate
16-20 April 2007
Firstpage
1
Lastpage
6
Abstract
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(2233) requires about 1.4 mm2 cell area in a 0.25mum technology and needs 80 musec for an EC point multiplication
Keywords
cryptography; energy consumption; multiplying circuits; polynomials; 0.25 micron; 80 mus; EC point multiplication; ECC designs; ECC hardware accelerators; GF(2m); energy consumption; hRAIK multiplication; iterative Karatsuba method; polynomial multiplier; Coprocessors; Elliptic curve cryptography; Elliptic curves; Energy consumption; Error correction codes; Hardware; Iterative methods; Polynomials; Public key cryptography; Silicon;
fLanguage
English
Publisher
ieee
Conference_Titel
Design, Automation & Test in Europe Conference & Exhibition, 2007. DATE '07
Conference_Location
Nice
Print_ISBN
978-3-9810801-2-4
Type
conf
DOI
10.1109/DATE.2007.364469
Filename
4211979
Link To Document