DocumentCode
596805
Title
Power efficiency of digit level polynomial basis finite field multipliers in GF(2283)
Author
Namin, S.H. ; Huapeng Wu ; Ahmadi, Mahdi
Author_Institution
Dept. of ECE, Univ. of Windsor, Windsor, ON, Canada
fYear
2012
fDate
9-12 Dec. 2012
Firstpage
897
Lastpage
900
Abstract
Several digit level finite field multiplier architectures have been proposed in the literature. Some of them are with power estimation with different VLSI technology for different field sizes which makes it difficult to compare their power efficiency. In this paper, we perform VLSI simulation for several existing digit level field multipliers in the same field, GF(2283), and with the same 0.18μm VLSI technology so that an effective comparison of their power efficiency along with other IC features such as area and critical path delay can be made. Recommendations of the most efficient finite field multiplier are given for the different application constraints. Detailed discussion is provided for power constrained mobile and wireless applications. The comparison results obtained in this paper are expected to be useful for those who design and/or implement elliptic curve cryptography for wireless and portable systems.
Keywords
VLSI; public key cryptography; GF(2283); IC features; VLSI simulation; VLSI technology; critical path delay; digit level polynomial basis finite field multipliers; elliptic curve cryptography; portable system; power constrained mobile application; power constrained wireless application; power efficiency; power estimation; size 0.18 mum; Computer architecture; Delay; Finite element methods; Logic gates; Polynomials; Power demand; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Circuits and Systems (ICECS), 2012 19th IEEE International Conference on
Conference_Location
Seville
Print_ISBN
978-1-4673-1261-5
Electronic_ISBN
978-1-4673-1259-2
Type
conf
DOI
10.1109/ICECS.2012.6463517
Filename
6463517
Link To Document