2000 character limit reached
Fast algorithms for ell-adic towers over finite fields
Published 25 Jan 2013 in cs.SC and math.NT | (1301.6021v1)
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 ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.