Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

DOI10.1109/TC.2010.132zbMATH Open1368.68224OpenAlexW2104954412MaRDI QIDQ5280607FDOQ5280607

Authors: Christophe Negre, M. Anwar 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)

Cited In (5)

• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
• Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
• Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
• Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields

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

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