LFSR-based Bit-Serial $GF(2^m)$ Multipliers using Irreducible Trinomials

DOI10.1109/TC.2020.2980259zbMATH Open1495.68015OpenAlexW3011867112MaRDI QIDQ5140211

José Luis Imaña

Publication date: 14 December 2020

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

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

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (3)

Title not available (Why is that?) ⋮ A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials ⋮ A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences

This page was built for publication: LFSR-based Bit-Serial $GF(2^m)$ Multipliers using Irreducible Trinomials

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