An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial

DOI10.1109/TIT.2013.2272072zbMATH Open1364.11166OpenAlexW1987118744MaRDI QIDQ5346327

Chaoping Xing, Michael Kaminski

Publication date: 8 June 2017

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

Full work available at URL: https://doi.org/10.1109/tit.2013.2272072

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Combinatorial codes (94B25)

Related Items (4)

The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear ⋮ Upper bounds for the size and the depth of formulae for MOD-functions ⋮ Title not available (Why is that?) ⋮ A complex-number Fourier technique for lower bounds on the mod-\(m\) degree

This page was built for publication: An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial

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