Low-Power Design for a Digit-Serial Polynomial Basis Finite Field Multiplier Using Factoring Technique

被引:16
作者
Namin, Shoaleh Hashemi [1 ]
Wu, Huapeng [1 ]
Ahmadi, Majid [1 ]
机构
[1] Univ Windsor, Dept Elect & Comp Engn, Windsor, ON N9B 3P4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Digit-serial architecture; elliptic curve (EC) cryptography; factoring method; finite field multiplier; low-power design; ARCHITECTURE;
D O I
10.1109/TVLSI.2016.2585980
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In CMOS-based application-specific integrated circuit (ASIC) designs, total power consumption is dominated by dynamic power, where dynamic power consists of two major components, namely, switching power and internal power. In this paper, we present a low-power design for a digit-serial finite field multiplier in GF(2(m)). In the proposed design, a factoring technique is used to minimize switching power. To the best of our knowledge, factoring method has not been reported in the literature being used in the design of a finite field multiplier at an architectural level. Logic gate substitution is also utilized to reduce internal power. Our proposed design along with several existing similar works have been realized for GF(2(233)) on ASIC platform, and a comparison is made between them. The synthesis results show that the proposed multiplier design consumes at least 27.8% lower total power than any previous work in comparison.
引用
收藏
页码:441 / 449
页数:9
相关论文
共 40 条
[1]  
[Anonymous], 2006, CORE65LPSVT 1 00V 4
[2]  
[Anonymous], 2000, IEEE Std 1459-2000, DOI [10.1109/IEEESTD.2000.93398, DOI 10.1109/IEEESTD.2000.93398, DOI 10.1109/IEEESTD.2000.91944]
[3]  
[Anonymous], 2009, POW COMP US GUID VER
[4]  
[Anonymous], 2007, INT J ELECT COMPUT S
[5]  
Balasubramanian P, 2007, CAN CON EL COMP EN, P243
[6]   A comparative cost/performance evaluation of digit-serial multipliers for finite fields of type GF(2n) [J].
Bertoni, G ;
Breveglieri, L ;
Fragneto, P .
14TH ANNUAL IEEE INTERNATIONAL ASIC/SOC CONFERENCE, PROCEEDINGS, 2001, :306-310
[7]   ALGORITHM ENGINEERING FOR PUBLIC KEY ALGORITHMS [J].
BETH, T ;
GOLLMANN, D .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (04) :458-466
[8]  
Chandrakasan A., 1995, Low Power Digital CMOS Design
[9]   Fast Parallel GF(2m) Polynomial Multiplication for All Degrees [J].
Cilardo, Alessandro .
IEEE TRANSACTIONS ON COMPUTERS, 2013, 62 (05) :929-943
[10]   Fast bit-parallel GF(2n) multiplier for all trinomials [J].
Fan, HN ;
Dai, YQ .
IEEE TRANSACTIONS ON COMPUTERS, 2005, 54 (04) :485-490