Fast Parallel GF(2^m) Polynomial Multiplication for All Degrees

DOI10.1109/TC.2012.63zbMath1365.65300MaRDI QIDQ5274393

Alessandro Cilardo

Publication date: 12 July 2017

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

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Fast Parallel GF(2^m) Polynomial Multiplication for All Degrees