A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields

DOI10.1109/TC.2007.19zbMath1390.65178OpenAlexW2150782829MaRDI QIDQ4564117

Haining Fan, M. Anwarul Hasan

Publication date: 12 June 2018

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

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

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (6)

Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product ⋮ Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation ⋮ Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields