Efficient Subquadratic Space Complexity Digit-Serial Multipliers over GF(2m) based on Bivariate Polynomial Basis Representation

被引:0
|
作者
Lee, Chiou-Yng [1 ]
Xie, Jiafeng [2 ]
机构
[1] Lunghwa Univ Sci & Technol, Comp Informat & Network Engn, Taoyuan 333, Taiwan
[2] Villanova Univ, Elect & Comp Engn, Villanova, PA 19010 USA
关键词
LOW-AREA; PARALLEL;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Digit-serial finite field multipliers over GF(2(m)) with subquadratic space complexity are critical components to many applications such as elliptic curve cryptography. In this paper, we propose a pair of novel digit-serial multipliers based on bivariate polynomial basis (BPB). Firstly, we have proposed a novel digit-serial BPB multiplication algorithm based on a new decomposition strategy. Secondly, the proposed algorithm is properly mapped into a pair of pipelined and non-pipelined digit-serial multipliers. Lastly, through the detailed complexity analysis and comparison, the proposed designs are found to have less area-time complexities than the competing ones.
引用
收藏
页码:253 / 258
页数:6
相关论文
共 50 条