Algorithms for finite fields

Karim Belabas 1, 2
2 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : This series of lectures concentrates on deterministic algorithms for finite fields. The emphasis is not on developing algorithms for practical use, but on viewing the quest for polynomial-time algorithms as a challenge of our structural understanding of finite fields. The topics treated include: representing finite fields, recognizing finite fields, constructing finite fields, constructing maps between finite fields and factoring polynomials.
Document type :
Book sections
Complete list of metadatas
Contributor : Karim Belabas <>
Submitted on : Thursday, January 16, 2014 - 7:42:07 PM
Last modification on : Thursday, January 11, 2018 - 6:22:36 AM


  • HAL Id : hal-00932379, version 1



Karim Belabas. Algorithms for finite fields. Explicit methods in number theory. Rational points and Diophantine equations, SMF, pp.1-18, 2012. ⟨hal-00932379⟩



Record views