Buch, Englisch, 614 Seiten, Format (B × H): 165 mm x 236 mm, Gewicht: 953 g
Buch, Englisch, 614 Seiten, Format (B × H): 165 mm x 236 mm, Gewicht: 953 g
Reihe: Discrete Mathematics and Its Applications
ISBN: 978-1-4398-6615-3
Verlag: Taylor & Francis
Requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. It first builds the foundation of computational number theory by covering the arithmetic of integers and polynomials at a very basic level. It then discusses elliptic curves, primality testing, algorithms for integer factorization, computing discrete logarithms, and methods for sparse linear systems. The text also shows how number-theoretic tools are used in cryptography and cryptanalysis. A dedicated chapter on the application of number theory in public-key cryptography incorporates recent developments in pairing-based cryptography.
With an emphasis on implementation issues, the book uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.
Zielgruppe
Advanced undergraduate and beginning graduate students and researchers in number theory and cryptography.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
Arithmetic of Integers. Arithmetic of Finite Fields. Arithmetic of Polynomials. Arithmetic of Elliptic Curves. Primality Testing. Integer Factorization. Discrete Logarithms. Large Sparse Linear Systems. Public-Key Cryptography. Appendices. Index.