## CryptoDB

### Paper: Elliptic Curve Point Multiplication

Authors: A.G.Rostovtsev E.B.Makhovenko URL: http://eprint.iacr.org/2003/088 Search ePrint Search Google A method for elliptic curve point multiplication is proposed with complex multiplication by Sqrt[-2] or by (1+Sqrt[-7])/2 instead of point duplication, speeding up multiplication about 1.34 times. Higher radix makes it possible to use one point duplication instead of two and to speed up computation about 1.6 times. We employ prime group order factorization in corresponding quadratic order and integer exponent reduction modulo quadratic prime in the Euclidean imaginary quadratic ring.
##### BibTeX
@misc{eprint-2003-11804,
title={Elliptic Curve Point Multiplication},
booktitle={IACR Eprint archive},
keywords={implementation / elliptic curve cryptosystem; complex multiplication; fast algorithms},
url={http://eprint.iacr.org/2003/088},
note={ rostovtsev@ssl.stu.neva.ru 12177 received 5 May 2003},
author={A.G.Rostovtsev and E.B.Makhovenko},
year=2003
}