Number Theory with Applications to Cryptography

Explores the application of number theory in the field of cryptography. The book introduces elementary methods of Diophantine equations, the basic theorem of arithmetic, and the Riemann Zeta function. It also discusses congruences and their use in mock theta functions, discrete log problems, elliptic curves, and matrices.

---

Number Theory with Applications to Cryptography takes into account the application of number theory in the field of cryptography. It comprises elementary methods of Diophantine equations, the basic theorem of arithmetic and the Riemann Zeta function. This book also discusses about Congruences and their use in mock theta functions, Method of Iterative Sliding Window for Shorter Number of Operations in case of Modular Exponentiation and Scalar Multiplication, Discrete log problem, elliptic curves, matrices and public-key cryptography and Implementation of Pollard Rho over binary fields using Brent Cycle Detection Algorithm. It also provides the reader with the significant insights of number theory to the practice of cryptography in order to understand discrete log problem, matrices, elliptic curves and public-key cryptography and the applications of Fibonacci sequence on continued fractions.