Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

DOI10.1109/TC.2010.132zbMath1368.68224OpenAlexW2104954412MaRDI QIDQ5280607

Christophe Negre, M. Anwarul Hasan

Publication date: 27 July 2017

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

Full work available at URL: https://doi.org/10.1109/tc.2010.132

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation