• Corpus ID: 239017020

Faster Modular Composition

  title={Faster Modular Composition},
  author={Vincent Neiger and Bruno Salvy and {\'E}ric Schost and Gilles Villard},
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by $n$, the algorithm uses $O(n^{1.43})$ field operations, breaking through the $3/2$ barrier in the exponent for the first time. The previous fastest algebraic algorithms, due to Brent and Kung in 1978, require $O(n^{1.63})$ field operations in general, and ${n^{3/2+o(1)}}$ field operations in the particular case of power… 

High-order lifting for polynomial Sylvester matrices

A new algorithm is presented for computing the resultant of two “su ffi ciently generic” bivariate polynomials over an arbitrary field. For such p and q in K [ x , y ] of degree d in x and n in y , the

Random Primes without Primality Testing

This work proposes a new variant of dynamic evaluation, applied to a randomly-chosen (composite) integer, and demonstrates how the exact number of nonzero terms in an unknown integer polynomial in quasi-linear time is computed.

Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation

The genericity assumption is explicit and it is proved that it holds for most point sets over a large enough field and if P violates the assumption, the algorithms still work and the performance degrades smoothly according to a distance from being generic.