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

DOI10.1109/TIT.2013.2272072MaRDI QIDQ5346327zbMATH OpenOpenAlexFDO

Authors Michael Kaminski, Chaoping Xing

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

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

Cited in

(4)

• A complex-number Fourier technique for lower bounds on the mod-\(m\) degree
• Upper bounds for the size and the depth of formulae for MOD-functions
• The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear
• scientific article; zbMATH DE number 7561747 (Why is no real title available?)

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)