Igor Shparlinski

David Kohel

This volume contains the proceedings of the Winter School and Workshop on Frobenius Distributions on Curves, held from February 17–21, 2014 and February 24–28, 2014, at the Centre International de Rencontres Mathématiques, Marseille, France. This volume gives a representative sample of current research and developments in the rapidly developing areas of Frobenius distributions. This is mostly driven by two famous conjectures: the Sato-Tate conjecture, which has been recently proved for elliptic curves by L. Clozel, M. Harris and R. Taylor, and the Lang-Trotter conjecture, which is still widely open. Investigations in this area are based on a fine mix of algebraic, analytic and computational techniques, and the papers contained in this volume give a balanced picture of these approaches.

Frobenius Distributions: Lang-Trotter and Sato-Tate Conjectures

This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.

The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography

Finite Fields: Theory and Computation

This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

Computational and Algorithmic Problems in Finite Fields

Kwok Yan Lam

Chaoping Xing

Huaxiong Wang

"Contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999"--Preface, p. [vii].

Igor Shparlinski

About

Books

Join the club