Low complexity bit-parallel multipliers for a class of finite fields
From MaRDI portal
Publication:4571476
DOI10.1109/12.707588zbMath1391.65191OpenAlexW1995214476MaRDI QIDQ4571476
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/12.707588
Related Items
Polynomial basis multiplication over \(\text{GF}(2^m)\), Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm, A Swan-like note for a family of binary pentanomials