Efficient multiplier architectures for Galois fields GF(2/sup 4n/)

DOI10.1109/12.663762zbMath1392.68054OpenAlexW1978404551MaRDI QIDQ4571442

Peter Roelse, Peter Fleischmann, Christof Paar

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.663762

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 (1)

Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial

This page was built for publication: Efficient multiplier architectures for Galois fields GF(2/sup 4n/)