Low-complexity multiplexer-based normal basis multiplier over GF(2 m )

被引:5
作者
Horng, Jenn-Shyong [1 ]
Jou, I-Chang [1 ]
Lee, Chiou-Yng [2 ]
机构
[1] Natl Kaohsiung First Univ Sci & Technol, Inst Engn Sci & Technol, Kaohsiung Cty 811, Taiwan
[2] Lunghwa Univ Sci & Technol, Dept Comp Informat & Network Engn, Taoyuan Cty 333, Taiwan
来源
JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE A | 2009年 / 10卷 / 06期
关键词
Finite field multiplication; Normal basis; Gaussian normal basis; Elliptic curve cryptosystem; OMURA PARALLEL MULTIPLIER; CONSTRUCTION;
D O I
10.1631/jzus.A0820398
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We present a new normal basis multiplication scheme using a multiplexer-based algorithm. In this algorithm, the proposed multiplier processes in parallel and has a multiplexer-based structure that uses MUX and XOR gates instead of AND and XOR gates. We show that our multiplier for type-1 and type-2 normal bases saves about 8% and 16%, respectively, in space complexity as compared to existing normal basis multipliers. Finally, the proposed architecture has regular and modular configurations and is well suited to VLSI implementations.
引用
收藏
页码:834 / 842
页数:9
相关论文
共 23 条