An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial

• Main Authors: Kaminski, Michael, Xing, Chaoping
• 其他作者: School of Physical and Mathematical Sciences
• 格式: Article
• 語言: English
• 出版: 2013
• 主題: DRNTU::Science::Mathematics::Applied mathematics::Information theory
• 在線閱讀: https://hdl.handle.net/10356/98695; http://hdl.handle.net/10220/17481

Let μq2(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 q2 element field BBF q2. It is shown that for all odd q and all n = 1,2,..., liminfk...