The theme of this book is the study of the distribution of integer powers modulo a prime number. It provides numerous new, sometimes quite unexpected, links between number theory and computer science as well as to other areas of mathematics. Possible applications include (but are not limited to) complexity theory, random number generation, cryptography, and coding theory. The main method discussed is based on bounds of exponential sums. Accordingly, the book contains many estimates of such sums, including new estimates of classical Gaussian sums. It also contains many open questions and proposals for further research.

"It is perhaps surprising that such a diverse collections of problems may be unified under one theme. This book should serve as a useful reference for mathematicians interested in such problems as well as a valuable source of open questions for research projects." Bulletin of the American Mathematical Society

"...this is a work that should be present in any decent mathematical library." Mathematical Reviews