Parallel multipliers based on special irreducible pentanomials

DOI10.1109/TC.2003.1252850zbMath1192.11080OpenAlexW2133814675MaRDI QIDQ3417061

Francisco Rodríguez-Henríquez, Çetin Kaya Koç

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2003.1252850

zbMATH Keywords

multipliers for \(\text{GF}(2^m)\)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (13)

Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ The parity of the number of irreducible factors for some pentanomials ⋮ Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication ⋮ Domain-oriented masked bit-parallel finite-field multiplier against side-channel attacks ⋮ Decomposition of Dillon's APN permutation with efficient hardware implementation ⋮ Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields ⋮ Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm ⋮ Montgomery multiplication over rings ⋮ Division of tetranomials by type II pentanomials and orthogonal arrays ⋮ Parity of the number of irreducible factors for composite polynomials ⋮ A Swan-like note for a family of binary pentanomials ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Parallel multipliers based on special irreducible pentanomials