CryptoDB
A New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields
Authors: | |
---|---|
Download: | |
Abstract: | Now, It is believed that the best costs of a point doubling and addition on elliptic curves over binary fields are 4M+5S(namely, four finite field multiplications and five field squarings) and 8M+5S, respectively. In this paper we reduce the costs to less than 3M+3S and 8M+1S, respectively, by using a new projective coordinates we call PL-coordinates and rewriting the point doubling formula. Combining some programming skills, the method can speed up a elliptic curve scalar multiplication by about 15?20 percent in practice. |
BibTeX
@misc{eprint-2007-13463, title={A New Method for Speeding Up Arithmetic on Elliptic Curves over Binary Fields}, booktitle={IACR Eprint archive}, keywords={implementation / elliptic curve cryptosystem, binary field, point doubling, point addition}, url={http://eprint.iacr.org/2007/181}, note={ kimkhhj1980@yahoo.com.cn 13646 received 13 May 2007}, author={Kwang Ho Kim and So In Kim}, year=2007 }