|Title:||An Algorithm for Polynomial Multiplication which does not Depend on the Ring Constants
|Abstract:||We present an algrithm for computing the coefficients of the product of two polynomials of degree n over the ring, of integers in O(nlgn) multiplications. This algorithms relies on the Chinese Remainder Theorem, with cyclotomic polynomial presented as the moduli. The algorithm can be implemented over any ring and its implementation does not depend on the ring constants.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1986/CS/CS0418), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1986
To the main CS technical reports page
Computer science department, Technion