Information Security Mathematical Foundations

Author: Chen Gongliang
Publisher:
Publish Date: 2004-06-01
Features:
This book features:
· Provides a detailed introduction to information security, particularly the mathematical theories involved in public-key cryptographic systems, such as number theory, algebra, and elliptic curve theory.
· Offers a comprehensive explanation of Euclidean division, modular congruence, Euler's theorem, the Chinese remainder theorem, quadratic congruence, primitive roots, finite groups, finite fields, and elliptic curves.
· Not only enables readers to understand the case studies of cryptographic systems from a mathematical perspective but also helps them apply their knowledge to construct secure and effective cryptographic systems.
This book systematically introduces the mathematical theories related to information security, including number theory, algebra, and elliptic curve theory, with a particular focus on the mathematical knowledge involved in information security engineering practices. Additionally, it covers some new mathematical achievements that have emerged in the research and application of information security. This book can serve as a textbook for undergraduate and graduate students in information security, communication, information, and computer science programs. It can also be referenced by researchers engaged in information security work.
This book systematically introduces the mathematical theories related to information security, including number theory, algebra, and elliptic curve theory, with a particular focus on the mathematical knowledge involved in information security engineering practices. Additionally, it covers some new mathematical achievements that have emerged in the research and application of information security. This book can serve as a textbook for undergraduate and graduate students in information security, communication, information, and computer science programs. It can also be referenced by researchers engaged in information security work.