| Description |
1 online resource (viii, 163 pages) |
| Series |
Cambridge tracts in mathematics ; 132 [i.e. 136] |
|
Cambridge tracts in mathematics ; 136.
|
| Contents |
pt. 1. Preliminaries -- 1. Introduction -- 2. Notation and Auxiliary Results -- pt. 2. 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 -- pt. 3. Multiplicative Translations of Sets -- 7. Multiplicative Translations of Subgroups of F*[subscript p] -- 8. Multiplicative Translations of Arbitrary Sets Modulo p -- pt. 4. Applications to Algebraic Number Fields -- 9. Representatives of Residue Classes -- 10. Cyclotomic Fields and Gaussian Periods -- pt. 5. Applications to Pseudo-Random Number Generators -- 11. Prediction of Pseudo-Random Number Generators -- 12. Congruential Pseudo-Random Number Generators -- pt. 6. Applications to Finite Fields -- 13. Small mth Roots Modulo p -- 14. Supersingular Hyperelliptic Curves -- 15. Distribution of Powers of Primitive Roots -- pt. 7. Applications to Coding Theory and Combinatorics -- 16. Difference Sets in V[subscript p] -- 17. Dimension of BCH Codes -- 18. An Enumeration Problem in Finite Fields |
| Summary |
The theme of this book is the distribution of integer powers modulo a prime number. It provides numerous new links between number theory and computer science as well as other areas of mathematics. Applications include (but are not limited to) complexity theory, random number generation, cryptography, and coding theory |
| Bibliography |
Includes bibliographical references (pages 157-161) and index |
| Notes |
Print version record |
| Subject |
Exponential sums.
|
|
MATHEMATICS -- Number Theory.
|
|
Exponential sums.
|
|
Exponential sums
|
|
Sommes exponentielles.
|
| Form |
Electronic book
|
| Author |
Shparlinski, Igor E
|
| ISBN |
0511040369 |
|
9780511040368 |
|
0511051794 |
|
9780511051791 |
|
9780521642637 |
|
0521642639 |
|
