Finite field multiplier using redundant representation

DOI10.1109/TC.2002.1047755MaRDI QIDQ4571246zbMATH OpenOpenAlexFDO

Authors Huapeng Wu, Shuhong Gao, M. Anwar Hasan, Ian Blake

Publication date 9 July 2018

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

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

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited in

(2)

• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
• Low complexity bit parallel multiplier for GF(2ᵐ) generated by equally-spaced trinomials

This page was built for publication: Finite field multiplier using redundant representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571246)