Fast algorithms for l-adic towers over finite fields

  • Authors:

  • Luca De Feo;Javad Doliskani;Eric Schost

  • Affiliations:

  • Université de Versailles, Paris, France;Western University, London, ON, Canada;Western University, London, ON, Canada

  • Venue:
  • Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in the first levels of) the l-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.