TY - GEN
T1 - Three dimensional Montgomery ladder, differential point tripling on Montgomery curves and point quintupling on Weierstrass’ and Edwards curves
AU - Subramanya Rao, Srinivasa Rao
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2016.
PY - 2016
Y1 - 2016
N2 - Elliptic Curve Cryptography is an important alternative to traditional public key schemes such as RSA. This paper presents (i) a simultaneous triple scalar multiplication algorithm to compute the x-coordinate of kP + lQ + uR on a Montgomery Curve Em defined over (image found)p which is about 15 to 22% faster than the straight forward method of doing the same. The algorithm, motivated by Bernstein’s paper on Differential Addition Chains, where the author proposes various 2-dimensional differential addition chains and asks for 3- dimensional versions to be constructed, can be generalized to other elliptic curve forms with differential addition formula, (ii) a formula for Differential point tripling on Montgomery Curves which is slightly better than computing 3P as 2P + P and relevant in the implementation of Montgomery’s PRAC and (iii) an improvement in Mishra and Dimitrov’s point Quintupling algorithm for Weierstrass’ curves and an efficient Quintupling algorithm for Edwards Curves.
AB - Elliptic Curve Cryptography is an important alternative to traditional public key schemes such as RSA. This paper presents (i) a simultaneous triple scalar multiplication algorithm to compute the x-coordinate of kP + lQ + uR on a Montgomery Curve Em defined over (image found)p which is about 15 to 22% faster than the straight forward method of doing the same. The algorithm, motivated by Bernstein’s paper on Differential Addition Chains, where the author proposes various 2-dimensional differential addition chains and asks for 3- dimensional versions to be constructed, can be generalized to other elliptic curve forms with differential addition formula, (ii) a formula for Differential point tripling on Montgomery Curves which is slightly better than computing 3P as 2P + P and relevant in the implementation of Montgomery’s PRAC and (iii) an improvement in Mishra and Dimitrov’s point Quintupling algorithm for Weierstrass’ curves and an efficient Quintupling algorithm for Edwards Curves.
KW - Akishita’s algorithm
KW - Bernstein’s algorithm
KW - Differential addition chains
KW - Differential point tripling
KW - Double scalar multiplication
KW - Edwards curves
KW - Lucas chains
KW - Montgomery curves
KW - Multiexponentiation
KW - Point quintupling
KW - Schoenmakers’ algorithm
KW - Triple scalar multiplication
UR - http://www.scopus.com/inward/record.url?scp=84964089316&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-31517-1_5
DO - 10.1007/978-3-319-31517-1_5
M3 - Conference contribution
SN - 9783319315164
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 84
EP - 106
BT - Progress in Cryptology – AFRICACRYPT 2016 - 8th International Conference on Cryptology in Africa, Proceedings
A2 - Pointcheval, David
A2 - Rachidi, Tajjeeddine
A2 - Nitaj, Abderrahmane
PB - Springer Verlag
T2 - 8th International Conference on the Theory and Application of Cryptographic Techniques in Africa, AFRICACRYPT 2016
Y2 - 13 April 2016 through 15 April 2016
ER -