Parallel Integer Polynomial Multiplication

12/17/2016
by   Changbo Chen, et al.
0

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 advantages of this new approach.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/03/2021

On Fast Computation of a Circulant Matrix-Vector Product

This paper deals with circulant matrices. It is shown that a circulant m...
02/16/2022

Sparse Polynomial Interpolation and Division in Soft-linear Time

Given a way to evaluate an unknown polynomial with integer coefficients,...
01/27/2019

Nearly Optimal Sparse Polynomial Multiplication

In the sparse polynomial multiplication problem, one is asked to multipl...
09/08/2020

Quad-Core RSA Processor with Countermeasure Against Power Analysis Attacks

Rivest-Shamir-Adleman (RSA) cryptosystem uses modular multiplication for...
04/29/2020

On the Existence of Algebraically Natural Proofs

For every constant c > 0, we show that there is a family {P_N, c} of pol...
03/02/2017

Faster truncated integer multiplication

We present new algorithms for computing the low n bits or the high n bit...
12/15/2018

Layer Based Partition for Matrix Multiplication on Heterogeneous Processor Platforms

While many approaches have been proposed to analyze the problem of matri...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.