@article{ciet2003trading,
author = {Ciet, Mathieu and Joye, Marc and Lauter, Kristin and Montgomery, Peter},
title = {Trading Inversions for Multiplications in Elliptic Curve Cryptography},
year = {2003},
month = {December},
abstract = {Recently, Eisentraeger-Lauter-Montgomery proposed a method for speeding up scalar multiplication on elliptic curves. That method relies on improved formulae for evaluating S = 2P + Q from given points P and Q on an elliptic curve. Compared to the naive approach, the improved formulae save a field multiplication each time the operation is performed. This paper proposes a variant which is faster whenever a field inversion is more expensive than six field multiplications. We also give an improvement when tripling or quadrupling a point, and present a ternary/binary method to perform efficient scalar multiplication.},
publisher = {Springer},
url = {http://approjects.co.za/?big=en-us/research/publication/trading-inversions-for-multiplications-in-elliptic-curve-cryptography-2/},
pages = {257},
journal = {Designs, Codes, and Cryptography},
volume = {2003},
edition = {Designs, Codes, and Cryptography},
}