View of the Cryptology on Elliptic Curves
Yan Wang, Pla Uni · Journal of PLA University of Science and Technology · 2002
In this paper, the basic contents of the cryptology on elliptic curves are summarized. The ECC and classical public key cryptogram system are compared. The rule discovered by Lenstra and Verheul is presensed. A simple description is given to the basic arithmetic and cryptography property on elliptic curves. The case of the Certicom ECC challenge is displayed. Depiction is made of the main contents of the ANSI Standard X9.62--ECDSA. The discrete logarithm on elliptic curves and attacks against ECDLP is discussed in detail. Finally analysis is made of the EC coding, classical EC cryptosystem and the study about fast ECC. The possible directions and contents of the study on ECC are displayed.