Introduction to Elliptic Curve Cryptography

Author: (Canada) Hankerson (D. Zhang Huanguo)
Publisher:
Publish Date: 2005-08-01
Features: Since Hendrik Lenstra presented the integer factorization algorithm based on elliptic curves in 1984, the application of elliptic curves in cryptography and computer number theory has undergone significant development. Elliptic curve cryptography belongs to the public-key cryptosystem, which can provide the same functionality as the RSA cryptosystem, with its security based on the difficulty of the elliptic curve discrete logarithm problem. This book is primarily intended for security professionals, technical developers, and individuals committed to elliptic curve cryptography applications. It introduces finite field algorithms, elliptic curve arithmetic, attacks targeting the elliptic curve discrete logarithm problem, the generation and verification of elliptic curve parameters and key pairs, the selection of elliptic curve protocols for digital signatures, public-key encryption, and key negotiation, as well as the software and hardware implementation of elliptic curve cryptography, side-channel attack techniques and preventive countermeasures, and more. Additionally, the book provides readers with numerous algorithms and references. The book is self-contained and is suitable for engineers, experts, and researchers in the fields of computer science, computer engineering, network design, and network data security. It can also serve as a textbook for senior undergraduate and graduate students in higher education institutions.