Rsa Conference on the Cryptographers Track
Faster elliptic curve arithmetic and improved weil pairing evaluation
作者:
K Eisenträger，K Lauter，PL Montgomery
关键词:
elliptic curve cryptosystem ； memory constraint ； pre-computation table ； side channel attacks ； smart card ； width-w NAF
摘要:
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication when we compute 2P+Q from given points P, Q on the curve. We give applications to simultaneous multiple scalar multiplication and to the Elliptic Curve Method of factorization. We show how this improvement together with another idea can speed the computation of the Weil and Tate pairings by up to 7.8 %.
在线下载