Abstract
A method for elliptic curve point multiplication is proposed with complex multiplication by √-2 or by (1±√-7)/2 instead of point doubling, speeding up multiplication about 1.34 times. Complex multiplication is given by isogeny of degree 2. Higher radix makes it possible to use one instead of two point doublings and to speed up computation about 1.61 times. Algorithm, representing exponent in √-2 -adic notation for digital signature protocols, is proposed. Key agreement and public key encryption protocols can be implemented directly in √-2 -adic notation. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Rostovtsev, A., & Makhovenko, E. (2003). Elliptic curve point multiplication. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2776, 328–336. https://doi.org/10.1007/978-3-540-45215-7_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
