Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis

Authors:
Sun-Mi Park;Ku-Young Chang;Dowon Hong
Affiliations:
-;-;-
Venue:
IEEE Transactions on Computers
Year:
2006

Citing 5
Cited 2

Mastrovito Multiplier for General Irreducible Polynomials

IEEE Transactions on Computers
Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials

IEEE Transactions on Computers
Software Implementation of Elliptic Curve Cryptography over Binary Fields

CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
Parallel Multipliers Based on Special Irreducible Pentanomials

IEEE Transactions on Computers
Fast Bit-Parallel GF(2^n) Multiplier for All Trinomials

IEEE Transactions on Computers

Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields

WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Efficient bit-parallel multipliers over finite fields GF(2m)

Computers and Electrical Engineering

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper, we present a bit-parallel multiplier for GF(2^m) defined by an irreducible pentanomial x^m+x^{k_3}+x^{k_2}+x^{k_1}+1, where 1\leq k_1