This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible

This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducib

The theory of finite fields, whose origins can be traced back to the works of Gauss and Galois, has played a part in various branches in mathematics. Inrecent y

The volume covers wide-ranging topics from Theory: structure of finite fields, normal bases, polynomials, function fields, APN functions. Computation: algorithm