Low Latency GF(2ᵐ) Polynomial Basis Multiplier

DOI10.1109/TCSI.2010.2089553MaRDI QIDQ5010601zbMATH OpenOpenAlexFDO

Authors José Luis Imaña

Publication date 26 August 2021

Published in IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcsi.2010.2089553

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited in

(2)

• A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
• Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials

This page was built for publication: Low Latency $GF(2^{m})$ Polynomial Basis Multiplier

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