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

page 1

page 2

page 3

page 4

research
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...
research
02/16/2022

Sparse Polynomial Interpolation and Division in Soft-linear Time

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

Nearly Optimal Sparse Polynomial Multiplication

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

Quad-Core RSA Processor with Countermeasure Against Power Analysis Attacks

Rivest-Shamir-Adleman (RSA) cryptosystem uses modular multiplication for...
research
06/27/2023

Revisiting Tropical Polynomial Division: Theory, Algorithms and Application to Neural Networks

Tropical geometry has recently found several applications in the analysi...
research
03/02/2017

Faster truncated integer multiplication

We present new algorithms for computing the low n bits or the high n bit...
research
09/11/2021

Implementing Parallel Quick Sort Algorithm on OTIS Hyper Hexa-Cell (OHHC) Interconnection Network

This work explores the characteristics of implementing parallel Quick So...

Please sign up or login with your details

Forgot password? Click here to reset