Low-complexity multiplexer-based normal basis multiplier over GF（2^m）

作     者：Jenn-Shyong HORNG I-Chang JOU Chiou-Yng LEE 

作者机构：Institute of Engineering Science and TechnologyNational Kaohsiung First University of Science and Technology Department of Computer Information and Network EngineeringLunghwa University of Science and Technology 

出 版 物：《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 (浙江大学学报（英文版）A辑（应用物理与工程）)

年 卷 期：2009年第10卷第6期

页      面：834-842页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Finite field multiplication Normal basis Gaussian normal basis Elliptic curve cryptosystem 

摘      要：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 con-figurations and is well suited to VLSI implementations.