附註:Includes bibliographical references (pages 504-509) and indexes.
Basic properties of the integers -- Congruences -- Computing with large integers -- Euclid's algorithm -- The distribution of primes -- Finite and discrete probability distributions -- Probabilistic algorithms -- Abelian groups -- Rings -- Probabilistic primality testing -- Finding generators and discrete logarithms in Z*p -- Quadratic residues and quadratic reciprocity -- Computational problems related to quadratic residues -- Modules and vector spaces -- Matrices -- Subexponential-time discrete logarithms and factoring -- More rings -- Polynomial arithmetic and applications -- Linearly generated sequences and applications -- Finite fields -- Algorithms for finite fields -- Deterministic primality testing.
摘要:This book can serve several purposes. It can be used as a reference and for self-study by readers who want to learn the mathematical foundations of modern cryptography. It is also ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.
