Character Sums with Exponential Functions and their Applications

Inbunden, Engelska, 1999

Del 136 i serien Cambridge Tracts in Mathematics

1 521 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:1999-09-02
Mått:152 x 229 x 11 mm
Vikt:400 g
Format:Inbunden
Språk:Engelska
Serie:Cambridge Tracts in Mathematics
Antal sidor:172
Förlag:Cambridge University Press
ISBN:9780521642637

Utforska kategorier

Recensioner i media

"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

Innehållsförteckning

Part I. Preliminaries: 1. Introduction; 2. Notation and auxiliary results; Part II. Bounds of Character Sums: 3. Bounds of long character sums; 4. Bounds of short character sums; 5. Bounds of character sums for almost all moduli; 6. Bounds of Gaussian sums; Part III. Multiplicative Translations of Sets: 7. Multiplicative translations of subgroups of F*p; 8. Multiplicative translations of arbitrary sets modulo p; Part IV. Applications to Algebraic Number Fields: 9 Representatives of residue classes; 10. Cyclotomic fields and Gaussian periods; Part V. Applications to Pseudo-random Number Generators: 11. Prediction of pseudo-random number generators; 12. Congruential pseudo-random number generators; Part VI. Applications to Finite Fields: 13. Small mth roots modulo p; 14. Supersingular hyperelliptic curves; 15. Distribution of powers of primitive roots; 16. Difference sets in Vp; 17. Dimension of BCH codes; 18. An enumeration problem in finite fields.