Computational problems in the theory of finite fields (Q1180998)

A survey of selected topics in the theory of finite fields is given with an emphasis on computational aspects including recent advances and open problems. Comments are given on available computer algebra software systems with finite field capability as well as more special purpose software for finite fields. The problem of choosing appropriate bases for efficient computation in finite fields is also discussed as well as the discrete logarithm problem. The current status of factoring polynomials, algorithms for the construction of irreducible polynomials and other types of polynomials is also noted.