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


Let &#x03BC;<sub>q</sub><sup>2</sup>(n,k) denote the minimum number of multiplications required to compute the coefficients of the product of two degree n k - 1 polynomials modulo the kth power of an irreducible polynomial of degree n over the q<sup>2</sup> element field \BBF q<sup>2</sup>. It is shown that for all odd q and all n = 1,2,..., liminfk &#x2192… (More)
DOI: 10.1109/TIT.2013.2272072


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics