Fast multiplication for skew polynomials

02/06/2017
by   Xavier Caruso, et al.
0

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our algorithms improve the best known complexity for these problems, and reach the optimal asymptotic complexity bound for large degree. We also give an adaptation of our algorithm for polynomials of small degree. Finally, we use our methods to improve on the best known complexities for various arithmetics problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2015

Fast Operations on Linearized Polynomials and their Applications in Coding Theory

This paper considers fast algorithms for operations on linearized polyno...
research
12/23/2022

Optimizing the half-gcd algorithm

In this paper, we propose a carefully optimized "half-gcd" algorithm for...
research
01/30/2020

The Lagrangian remainder of Taylor's series, distinguishes O(f(x)) time complexities to polynomials or not

The purpose of this letter is to investigate the time complexity consequ...
research
03/30/2018

Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform

We show a new algorithm and its implementation for multiplying bit-polyn...
research
04/21/2020

Fast and accurate evaluation of dual Bernstein polynomials

Dual Bernstein polynomials find many applications in approximation theor...
research
02/22/2020

SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm

Sample- and computationally-efficient distribution estimation is a funda...
research
12/13/2019

The quadratic hull of a code and the geometric view on multiplication algorithms

We introduce the notion of quadratic hull of a linear code, and give som...

Please sign up or login with your details

Forgot password? Click here to reset