Finite field multiplier using redundant representation

DOI10.1109/TC.2002.1047755zbMath1392.68063OpenAlexW2167456209MaRDI QIDQ4571246

Shuhong Gao, Huapeng Wu, M. Anwarul Hasan, Ian F. 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

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

Related Items

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^m)\) generated by equally-spaced trinomials