Character sums with exponential functions and their applications
Book information
Description
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.
Similar books
Character Sums with Exponential Functions and their Applications
1994 · PDF
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
2013 · DJVU
Number Theoretic Methods in Cryptography: Complexity lower bounds
1999 · DJVU
Frobenius Distributions: Lang-Trotter and Sato-Tate Conjectures: Winter School on Frobenius Distributions on Curves February 17-21, 2014, Workshop on ... Distributions o
2016 · PDF
Number Theory and Related Fields: In Memory of Alf van der Poorten
2013 · PDF
Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness
2003 · PDF
Cryptography and Computational Number Theory
2001 · PDF
Cryptography and Computational Number Theory
2001 · DJVU