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

• المؤلفون الرئيسيون: Kaminski, Michael, Xing, Chaoping
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: 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...