Abhijit Das

Computational Number Theory (eBook, PDF)

• Format: PDF

Produktbeschreibung

Developed from the author's popular graduate-level course, this self-contained text presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra and 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. With an emphasis on implementation issues, it 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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis
• Seitenzahl: 614
• Erscheinungstermin: 19. April 2016
• Englisch
• ISBN-13: 9781482205824
• Artikelnr.: 56962211

Autorenporträt

Abhijit Das is an associate professor in the Department of Computer Science and Engineering at the Indian Institute of Technology, Kharagpur. His research interests are in the areas of arithmetic and algebraic computations with specific applications to cryptology.

Inhaltsangabe

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.

Rezensionen

"This book would be a good choice for cryptography and engineering students wanting to learn the basics of algorithmic number theory."
-Mathematical Reviews, November 2014