Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2m)

Authors:
Chiou-Yng Lee;Chia-Chen Fan;Erl-Huei Lu
Affiliations:
Department of Computer Information and Network Engineering, Lunghwa University of Science and Technology, Taoyuan County 33302, Taiwan, ROC.;Department of Computer Information and Network Engineering, Lunghwa University of Science and Technology, Taoyuan County 33302, Taiwan, ROC.;Department of Electrical Engineering, Chang Gung University, Taoyuan County 33302, Taiwan, ROC
Venue:
International Journal of Autonomous and Adaptive Communications Systems
Year:
2011

Citing 15
Cited 0

Optimal normal bases in GF(pn)

Discrete Applied Mathematics
Construction and distribution problems for irreducible trinomials over finite fields

Applications of finite fields
Montgomery Multiplication in GF(2^k

Designs, Codes and Cryptography
Efficient Normal Basis Multipliers in Composite Fields

IEEE Transactions on Computers
An Efficient Optimal Normal Basis Type II Multiplier

IEEE Transactions on Computers
Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials

IEEE Transactions on Computers
Handbook of Applied Cryptography

Handbook of Applied Cryptography
GF(2m) Multiplication and Division Over the Dual Basis

IEEE Transactions on Computers
Montgomery Multiplier and Squarer in GF(2m)

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
A Low Complexity and a Low Latency Bit Parallel Systolic Multiplier over GF(2m) Using an Optimal Normal Basis of Type II

ARITH '03 Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16'03)
Efficient scalable VLSI architecture for Montgomery inversion in GF(p)

Integration, the VLSI Journal
Low Complexity Word-Level Sequential Normal Basis Multipliers

IEEE Transactions on Computers
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)

IEEE Transactions on Computers
Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2m)

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
CMOS Digital Integrated Circuits Analysis & Design

CMOS Digital Integrated Circuits Analysis & Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work presents a novel combined circuit architecture for computing normal basis (NB) and Montgomery multiplications, which is based on a Hankel matrix approach. Analytical results reveal that the proposed multiplier has lower space complexity than existing systolic multipliers. Moreover, by using the combined circuit architecture, the proposed scalable multiplier over the composite fields is also presented. Analytical results reveal that the proposed multiplier has lower space complexity than existing systolic NB and Montgomery multipliers. Moreover, the proposed architecture is regular, modular and locally interconnectable, making it well suited for implementing VLSI.