About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Theoretical Computer Science
Paper
On multiplication in algebraic extension fields
Abstract
In this paper we characterize all algorithms for obtaining the coefficients of (Σn-1i=0 xiui)(Σn-1i=0 yiui) mod P(u), where P(u) is an irreducible po lynomial of degree n, which use 2n - 1 multiplications. It is shown that up to equivalence, all such algorithms are obtainable by first obtaining the coefficients of the product of two polynomials, and then reducing modulo the irreducible polynomial. © 1979.