Nicht aus der Schweiz? Besuchen Sie lehmanns.de
A Computational Introduction to Number Theory and Algebra - Victor Shoup

A Computational Introduction to Number Theory and Algebra

(Autor)

Buch | Hardcover
600 Seiten
2008 | 2nd Revised edition
Cambridge University Press (Verlag)
978-0-521-51644-0 (ISBN)
CHF 99,45 inkl. MwSt
This introductory book emphasizes algorithms and applications, and is accessible to a broad audience. The author alternates between theory and applications in order to illustrate the mathematics. This second edition includes many new exercises and worked examples, and has been reorganized to improve presentation and clarity of exposition.
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasizes algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The presentation alternates between theory and applications in order to motivate and illustrate the mathematics. The mathematical coverage includes the basics of number theory, abstract algebra and discrete probability theory. This edition now includes over 150 new exercises, ranging from the routine to the challenging, that flesh out the material presented in the body of the text, and which further develop the theory and present new applications. The material has also been reorganized to improve clarity of exposition and presentation. Ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.

Victor Shoup is a Professor in the Department of Computer Science at the Courant Institute of Mathematical Sciences, New York University.

Preface; Preliminaries; 1. Basic properties of the integers; 2. Congruences; 3. Computing with large integers; 4. Euclid's algorithm; 5. The distribution of primes; 6. Abelian groups; 7. Rings; 8. Finite and discrete probability distributions; 9. Probabilistic algorithms; 10. Probabilistic primality testing; 11. Finding generators and discrete logarithms in Z*p; 12. Quadratic reciprocity and computing modular square roots; 13. Modules and vector spaces; 14. Matrices; 15. Subexponential-time discrete logarithms and factoring; 16. More rings; 17. Polynomial arithmetic and applications; 18. Linearly generated sequences and applications; 19. Finite fields; 20. Algorithms for finite fields; 21. Deterministic primality testing; Appendix: some useful facts; Bibliography; Index of notation; Index.

Erscheint lt. Verlag 4.12.2008
Zusatzinfo Worked examples or Exercises
Verlagsort Cambridge
Sprache englisch
Maße 170 x 244 mm
Gewicht 1200 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Algebra
Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Arithmetik / Zahlentheorie
ISBN-10 0-521-51644-7 / 0521516447
ISBN-13 978-0-521-51644-0 / 9780521516440
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95