Low-complexity multiplier for GF(2m) based on all-one polynomials

Authors:
Jiafeng Xie;Pramod Kumar Meher;Jianjun He
Affiliations:
School of Information Science and Engineering, Central South University, Changsha, China;Department of Embedded Systems, Institute for Infocomm Research, Singapore;School of Information Science and Engineering, Central South University, Changsha, China
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2013

Citing 18
Cited 0

Structure of parallel multipliers for a class of fields GF(2m)

Information and Computation
Mastrovito Multiplier for All Trinomials

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

IEEE Transactions on Computers
A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Quadrinomial Modular Arithmetic using Modified Polynomial Basis

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Low-Complexity Bit-Parallel Systolic Montgomery Multipliers for Special Classes of GF(2^m)

IEEE Transactions on Computers
A digit-serial multiplier for finite field GF(2m)

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation

IEEE Transactions on Computers
Relationship between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms

IEEE Transactions on Computers
LFSR multipliers over GF(2m) defined by all-one polynomial

Integration, the VLSI Journal
Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields

IEEE Transactions on Computers
New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations

Journal of Signal Processing Systems
An optimized design for serial-parallel finite field multiplication over GF(2m) based on all-one polynomials

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)

IEEE Transactions on Computers
Ringed bit-parallel systolic multipliers over a class of fields GF(2m)

Integration, the VLSI Journal
Low complexity digit serial systolic montgomery multipliers for special class of GF(2m)

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Error-Correcting Codes for Concurrent Error Correction in Bit-Parallel Systolic and Scalable Multipliers for Shifted Dual Basis of GF(2^m)

ISPA '10 Proceedings of the International Symposium on Parallel and Distributed Processing with Applications
Systolic and non-systolic scalable modular designs of finite field multipliers for reed-solomon codec

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an area-time-efficient systolic structure for multiplication over GF(2m) based on irreducible all-one polynomial (AOP). We have used a novel cut-set retiming to reduce the duration of the critical-path to one XOR gate delay. It is further shown that the systolic structure can be decomposed into two or more parallel systolic branches, where the pair of parallel systolic branches has the same input operand, and they can share the same input operand registers. From the application-specific integrated circuit and field-programmable gate array synthesis results we find that the proposed design provides significantly less area-delay and power-delay complexities over the best of the existing designs.