
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

Correction on "A Scalar Multiplication Algorithm with Recovery of the yCoordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"
JiinChiou CHENG WenChung KUO ChiSung LAIH
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E87A
No.7
pp.18271829 Publication Date: 2004/07/01 Online ISSN:
DOI: Print ISSN: 09168508 Type of Manuscript: LETTER Category: Information Security Keyword: elliptic curve cryptosystem, Montgomeryform elliptic cuvre, multiplication,
Full Text: PDF(85.2KB)>>
Summary:
In, Okeya and Sakurai proposed the recovery of the ycoordinate on a Montgomeryform elliptic curve. With their method, it can calculate efficiently coordinates of scalar multiplication of point, in which we need only xcoordinate and finally, (x,y) of the terminal point can be recovered. The method is very suitable for some applications such as ECDSAV 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.

