Refined Computations for Points of the Form 2kP Based on Montgomery Trick

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

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

著者

• Adachi Daisuke

  Graduate School Of Engineering Nagoya University

• Hirata Tomio

  Nagoya Univ. Nagoya‐shi Jpn

• Hirata Tomio

  Graduate School Of Engineering Nagoya University

• HIRATA Tomio

  Graduate School of Engineering, Nagoya University

関連論文

• 4C3 AN ADAPTIVE MEMORY LAGRANGIAN HEURISTIC ALGORITHM BASED ON THE SET COVERING APPROACH FOR THE MULTICUT PROBLEM
• Inapproximability of the Minimum Biclique Edge Partition Problem
• Inapproximability of the Edge-Contraction Problem(Discrete Mathematics and Its Applications)
• Robust Hole Transport in a Thienothiophene Derivative toward Low-cost Electronics
• Refined Computations for Points of the Form 2kP Based on Montgomery Trick
• An Improved Algorithm for the Nearly Equitable Edge-Coloring Problem
• On the Large Threshold Voltage Shifts of Nano-structured Thin Film Electroluminescent Devices

スポンサーリンク