Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation

DOI10.1109/TC.2010.141zbMath1366.94476MaRDI QIDQ5280653

Jean-Claude Bajard, Christophe Negre, Thomas Plantard

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (1)

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

This page was built for publication: Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation