Modular Composition Modulo Triangular Sets and Applications

  • Authors:

  • Adrien Poteaux;Éric Schost

  • Affiliations:

  • LIFL, UMR-CNRS 8022, Lille, France;Computer Science Department, The University of Western, Ontario, London, Canada

  • Venue:
  • Computational Complexity
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We generalize Kedlaya and Umans' modular composition algorithm to the multivariate case. As a main application, we give fast algorithms for many operations involving triangular sets (over a finite field), such as modular multiplication, inversion, or change of order. For the first time, we are able to exhibit running times for these operations that are almost linear, without any overhead exponential in the number of variables. As a further application, we show that, from the complexity viewpoint, Charlap, Coley, and Robbins' approach to elliptic curve point counting can be competitive with the better known approach due to Elkies.