Improved n-Term Karatsuba-Like Formulas in GF(2)

DOI10.1109/TC.2010.233MaRDI QIDQ5280555zbMATH OpenOpenAlexFDO

Authors Ivan Oseledets

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.233

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Polynomials in general fields (irreducibility, etc.) (12E05)

Cited in

(2)

• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak

This page was built for publication: Improved n-Term Karatsuba-Like Formulas in GF(2)

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