A Fast Algorithm on Pairs for Elliptic Curve Cryptosystems
Xiaoqiang Xiao · Journal of Hunan University of Arts and Science · 2007
In the application of Elliptic Curve Cryptography, the pairs of scalar multiplication calculation are required to perform. The pairs of scalar multiplication always use the three element joint sparse form. A fast Shamir-like algorithm is derived from five element joint sparse form, and its advantage over the three element joint sparse form is demonstrated.