Algorithm Number Theory

Author: Pei Dingyi
Publisher:
Publish Date: 2003-06-01
Features: This book discusses the basic contents of algorithmic number theory, including: continued fractions, algebraic number fields, elliptic curves, primality testing, algorithms for factoring large integers, discrete logarithms on elliptic curves, and hyperelliptic curves. The book's feature is its broad coverage, incorporating necessary prerequisites and mathematical proofs within a limited space to form a complete system as much as possible. Additionally, some parts of the book have been used multiple times as teaching materials for master's students at the State Key Laboratory of Information Security, University of Chinese Academy of Sciences, and at Guangzhou University. This book can serve as a graduate textbook for students majoring in information security, number theory, and related fields, as well as a reference for researchers, university teachers, and advanced students in higher education.