Fast Computation over Elliptic Curves E(F_q^n) Based on Optimal Addition Sequences : Special Section on Cryptography and Information Security

スポンサーリンク

概要

• 論文の詳細を見る

• A fast method for computing a multiple mP for a point P on elliptic curves is proposed. This new method is based on optimal addition sequences and the Frobenius map. The new method can effectively applied to elliptic curves E(F_q^n), where q is a prime power of medium size (e.g., q 〓 128). When we compute mP over curves E(F_q^n) with q^n of nearly 160-bits and 11 〓 q 〓 128, the new mwthod requires less elliptic curve additions than previously proposed methods. In this case, the average number of elliptic curve additions ranges from 40 to 50.

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

著者

• TSURUOKA Yukio

  The authors are with NTT Communication Science Laboratories

• KOYAMA Kenji

  The authors are with NTT Communication Science Laboratories

関連論文

• Cryptographic Works of Dr. Kenji Koyama: In Memoria : Special Section on Cryptography and Information Security
• Fast Computation over Elliptic Curves E(F_q^n) Based on Optimal Addition Sequences : Special Section on Cryptography and Information Security

スポンサーリンク