Parallel Integer Polynomial Multiplication

Changbo Chen (1) , Svyatoslav Covanov (2) , Farnam Mansouri (1) , Marc Moreno Maza (1) , Ning Xie (1) , Yuzhen Xie (1)

1 UWO - University of Western Ontario
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms

We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantage of this new approach.

Mots clés: Polynomial algebra; Symbolic computation; Parallel processing; Cache complexity; Multi-core architectures

Domaines: Calcul parallèle, distribué et partagé [cs.DC]; Complexité [cs.CC]

Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, et al.. Parallel Integer Polynomial Multiplication. SYNASC 2016 - 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2016, Timisoara, Romania. pp.72 - 80, ⟨10.1109/SYNASC.2016.024⟩. ⟨hal-01520021⟩