Correction on "A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"
Summary :
In, Okeya and Sakurai proposed the recovery of the y-coordinate on a Montgomery-form elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only x-coordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSA-V and MQV, etc. Unfortunately, there is a significant fault in that paper. Thus, many results about computation amount are wrong due to the significant fault. First, we will show this fault, and then raise the correction of the significant fault. Finally, Table A・1 about comparison of computation amount in is also corrected.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.7 pp.1827-1829
- Publication Date
- 2004/07/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jiin-Chiou CHENG, Wen-Chung KUO, Chi-Sung LAIH, "Correction on "A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 7, pp. 1827-1829, July 2004, doi: .
Abstract: In, Okeya and Sakurai proposed the recovery of the y-coordinate on a Montgomery-form elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only x-coordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSA-V and MQV, etc. Unfortunately, there is a significant fault in that paper. Thus, many results about computation amount are wrong due to the significant fault. First, we will show this fault, and then raise the correction of the significant fault. Finally, Table A・1 about comparison of computation amount in is also corrected.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_7_1827/_p
Copy
@ARTICLE{e87-a_7_1827,
author={Jiin-Chiou CHENG, Wen-Chung KUO, Chi-Sung LAIH, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Correction on "A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"},
year={2004},
volume={E87-A},
number={7},
pages={1827-1829},
abstract={In, Okeya and Sakurai proposed the recovery of the y-coordinate on a Montgomery-form elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only x-coordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSA-V and MQV, etc. Unfortunately, there is a significant fault in that paper. Thus, many results about computation amount are wrong due to the significant fault. First, we will show this fault, and then raise the correction of the significant fault. Finally, Table A・1 about comparison of computation amount in is also corrected.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - Correction on "A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1827
EP - 1829
AU - Jiin-Chiou CHENG
AU - Wen-Chung KUO
AU - Chi-Sung LAIH
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2004
AB - In, Okeya and Sakurai proposed the recovery of the y-coordinate on a Montgomery-form elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only x-coordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSA-V and MQV, etc. Unfortunately, there is a significant fault in that paper. Thus, many results about computation amount are wrong due to the significant fault. First, we will show this fault, and then raise the correction of the significant fault. Finally, Table A・1 about comparison of computation amount in is also corrected.
ER -
English
