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

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

Full description

Saved in:
Bibliographic Details
Published inJournal of Zhejiang University. A. Science Vol. 10; no. 6; pp. 834 - 842
Main Authors Horng, Jenn-Shyong, Jou, I-Chang, Lee, Chiou-Yng
Format Journal Article
LanguageEnglish
Published Hangzhou Zhejiang University Press 01.06.2009
Subjects
Civil Engineering
Classical and Continuum Physics
Engineering
Industrial Chemistry/Chemical Engineering
Mechanical Engineering
Elliptic curve cryptosystem
Gaussian normal basis
TP309
Finite field multiplication
Normal basis
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1673-565X
1862-1775
DOI:10.1631/jzus.A0820398