Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination

DOI10.1109/TC.2013.105MaRDI QIDQ5268073zbMATH OpenOpenAlexFDO

Authors Murat Cenk, Christophe Negre, M. Anwar Hasan

Publication date 20 June 2017

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

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

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Cryptography (94A60) Finite fields and commutative rings (number-theoretic aspects) (11T99) Number-theoretic algorithms; complexity (11Y16)

Cited in

(1)

• Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

This page was built for publication: Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination

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