2024-03-29T01:20:57Z
https://nagoya.repo.nii.ac.jp/oai
oai:nagoya.repo.nii.ac.jp:00013170
2023-01-16T04:00:16Z
320:321:322
Refined Computations for Points of the Form 2kP Based on Montgomery Trick
ADACHI, Daisuke
HIRATA, Tomio
open access
Copyright (C) 2006 IEICE
scalar multiplication
elliptic curve arithmetic
Montgomery trick
window method
This paper focuses on algorithms for an efficient scalar multiplication. It proposes two algorithms for computing points of the form 2^kP in affine coordinates. One works for k=2, and the other works for an arbitrary natural number k. The efficiency of these algorithms is based on a trade-off between a field inversion and several field multiplications. Montgomery trick is used to implement this trade-off. Since a field inversion is usually more expensive than 10 field multiplications, the proposed algorithms are efficient in comparison with existing ones.
Institute of Electronics, Information and Communication Engineers
2006-01-01
eng
journal article
VoR
http://hdl.handle.net/2237/15065
https://nagoya.repo.nii.ac.jp/records/13170
http://www.ieice.org/jpn/trans_online/index.html
0916-8508
IEICE transactions on fundamentals of electronics, communications and computer sciences
E89-A
1
334
339
https://nagoya.repo.nii.ac.jp/record/13170/files/464.pdf
application/pdf
105.2 kB
2018-02-20