Efficient Subquadratic Space Complexity Binary Polynomial Multipliers Based on Block Recombination

DOI10.1109/TC.2013.105zbMath1364.65322OpenAlexW2046896539MaRDI QIDQ5268073

Christophe Negre, Murat Cenk, M. Anwarul 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

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

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