Publishing Service

Polishing & Checking

Journal of Zhejiang University SCIENCE A

ISSN 1673-565X(Print), 1862-1775(Online), Monthly

2009 Vol.10 No.6 P.834-842

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

Jenn-Shyong HORNG, I-Chang JOU, Chiou-Yng LEE

Institute of Engineering Science and Technology, National Kaohsiung First University of Science and Technology, Taiwan 811, Kaohsiung County; Department of Computer Information and Network Engineering, Lunghwa University of Science and Technology, Taiwan 333, Taoyuan County

shyong1@cht.com.tw

Abstract: 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.

Key words: Finite field multiplication, Normal basis, Gaussian normal basis, Elliptic curve cryptosystem


Share this article to： More

Go to Contents

References:

<Show All>

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





DOI:

10.1631/jzus.A0820398

CLC number:

TP309

Download Full Text:

Click Here

Downloaded:

2732

Clicked:

5755

Cited:

4

On-line Access:

Received:

2008-05-26

Revision Accepted:

2008-11-18

Crosschecked:

2009-04-29

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952276; Fax: +86-571-87952331; E-mail: jzus@zju.edu.cn
Copyright © 2000~ Journal of Zhejiang University-SCIENCE