Correction on "A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"(Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• In [4], 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 [4] is also corrected.

• 社団法人電子情報通信学会の論文
• 2004-07-01

著者

• Laih Chi-sung

  Department Of Electrical Engineering National Cheng Kung University

• Kuo Wen-chung

  Department Of Computer Science And Information Engineering National Huwei Institute Of Technology

• CHENG Jiin-Chiou

  Department of Electrical Engineering National Cheng Kung University

関連論文

• A Tempo-Based t-out-of-n Audio Cryptography Scheme (Information Security)
• New Signature Schemes Based on Factoring and Discrete Logarithms (Special Section on Cryptography and Information Security)
• Correction on "A Scalar Multiplication Algorithm with Recovery of the y-Coordinate on the Montgomery Form and Analysis of Efficiency for Elliptic Curve Cryptosystems"(Information Security)
• Efficient Squaring of Large Integers(Discrete Mathematics and Its Applications)
• A Steganographic Scheme Based on Formula Fully Exploiting Modification Directions

スポンサーリンク