Low Latency $GF(2^{m})$ Polynomial Basis Multiplier
From MaRDI portal
Publication:5010601
DOI10.1109/TCSI.2010.2089553zbMath1468.94450OpenAlexW2197434848MaRDI QIDQ5010601
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Finite fields (field-theoretic aspects) (12E20)
This page was built for publication: Low Latency $GF(2^{m})$ Polynomial Basis Multiplier