Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation

DOI10.1109/TC.2010.141MaRDI QIDQ5280653zbMATH OpenFDO

Authors 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) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited in

(4)

• Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
• Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

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

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