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...
Saved in:
Published in | Journal of Zhejiang University. A. Science Vol. 10; no. 6; pp. 834 - 842 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Hangzhou
Zhejiang University Press
01.06.2009
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 |