An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication

Yasuyuki SAKAI; Kouichi SAKURAI

An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication

Yasuyuki SAKAI, Kouichi SAKURAI

Full Text Views

0

Share
Cite this

Summary :

The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP+lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP+lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.5 pp.1135-1146

Publication Date: 2003/05/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)

Category

Cite this

Copy

Yasuyuki SAKAI, Kouichi SAKURAI, "An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 5, pp. 1135-1146, May 2003, doi: .
Abstract: The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP+lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP+lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e86-a_5_1135/_p

Copy

@ARTICLE{e86-a_5_1135,
author={Yasuyuki SAKAI, Kouichi SAKURAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication},
year={2003},
volume={E86-A},
number={5},
pages={1135-1146},
abstract={The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP+lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP+lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - An Efficient Representation of Scalars for Simultaneous Elliptic Scalar Multiplication
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1135
EP - 1146
AU - Yasuyuki SAKAI
AU - Kouichi SAKURAI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2003
AB - The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP+lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP+lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.
ER -