Novel bit-parallel multiplier for GF(2m) defined by all-one polynomial using generalized Karatsuba algorithm

Authors:
Xiao-Ning Xie;Gong-Liang Chen;Yin Li
Affiliations:
School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200240, China;School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200240, China;Department of Computer Science and Technology, Xinyang Normal University, Henan 464000, China
Venue:
Information Processing Letters
Year:
2014

Citing 21
Cited 0

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

Information and Computation
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields

IEEE Transactions on Computers
Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields

IEEE Transactions on Computers
Multiplexer-Based Array Multipliers

IEEE Transactions on Computers
Mastrovito Multiplier for All Trinomials

IEEE Transactions on Computers
Elliptic curves in cryptography

Elliptic curves in cryptography
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})

IEEE Transactions on Computers
A New Hardware Architecture for Operations in GF(2m)

IEEE Transactions on Computers
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields

IEEE Transactions on Computers
Finite Field Multiplier Using Redundant Representation

IEEE Transactions on Computers
A New Low Complexity Parallel Multiplier for a Class of Finite Fields

CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Efficient Multiplication Beyond Optimal Normal Bases

IEEE Transactions on Computers
Parallel Multipliers Based on Special Irreducible Pentanomials

IEEE Transactions on Computers
Five, Six, and Seven-Term Karatsuba-Like Formulae

IEEE Transactions on Computers
Low Complexity Bit-Parallel Multiplier for GF(2^m) Defined by All-One Polynomials Using Redundant Representation

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

Integration, the VLSI Journal
Area and time efficient AB2 multipliers based on cellular automata

Computer Standards & Interfaces
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
A high-speed word level finite field multiplier in F2m using redundant representation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Multiplexer implementation of low-complexity polynomial basis multiplier in GF(2m) using all one polynomial

Information Processing Letters
An Efficient Finite Field Multiplier Using Redundant Representation

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, a novel bit-parallel multiplier for finite field GF(2^m) defined by irreducible all-one polynomial (AOP) is proposed. We utilize a generalized Karatsuba algorithm (KA) to reduce the number of coefficient multiplications and the redundant representation to simplify polynomial modular reduction. Explicit formulae with respect to the space and time complexity of the proposed multiplier are given. By evaluating the asymptotic lower bound of the complexity, the selection of the generalized KA and decomposition of m are investigated to obtain the optimal result. Consequently, theoretical complexity analysis proved that our architecture requires even fewer logic gates than previous proposals, while it still maintains relatively low time delay. For a special class of GF(2^m) generated with AOPs, it even matches the best known multipliers found in the literatures.