- 307 pages
- English
- PDF
- Available on iOS & Android
Number Theory with Applications to Cryptography
About This Book
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.
Frequently asked questions
Information
Table of contents
- Cover
- Title Page
- Copyright
- DECLARATION
- ABOUT THE EDITOR
- TABLE OF CONTENTS
- List of Contributors
- List of Abbreviations
- Preface
- SECTION I: DIOPHANTINE EQUATIONS
- SECTION II: THE RIEMANN ZETA FUNCTION AND THE FUNDAMENTAL THEOREM OF ARITHMETIC
- SECTION III: CONGRUENCES
- SECTION IV: DISCRETE LOG PROBLEM, ELLIPTIC CURVES, MATRICES AND PUBLIC-KEY CRYPTOGRAPHY
- SECTION V: CONTINUED FRACTIONS
- Index
- Back Cover