Fast Arithmetic of Elliptic Curve Cryptosystem Based on Binary Field
Zhengzhong Bian · Jisuanji gongcheng · 2003
The elliptic curve cryptosystem (ECC) provides the highest strength-per-bit of any cryptosystem known today. This paper describes the mathematics base of algebraic geometry and ECC. It also discusses the elliptic curve discrete logarithm problem (ECDLP) and the security applications of ECC on E-commerce . A fast arithmetic of ECC based on binary field is designed by the map of between affine coordinates and protective coordinates. This make it possible that ECC's practical applications in the electronic commerce.