Computing Short Lucas Chains for Elliptic Curve Cryptosystems (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• Elliptic curves E_m: By^2=x^3+Ax^2+x are suitable for cryptographic use because fast addition operations can be defined over Era. In elliptic curve cryptosystems, encryption/decryption involves multiplying a point P on Em by a large integer n. In this paper, we propose a fast algorithm for computing such scalar multiplication over Era. The new algorithm requires fewer operations than previously proposed algorithms. As a result, elliptic curve cryptosystems based on Era can be speeded up by using the new algorithm.

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

著者

• Tsuruoka Yukio

  NTT Communication Science Laboratories

関連論文

• A New RSA-Type Scheme Based on Singular Cubic Curves y^2≡x^3+bx^2 (mod n)
• Fast Exponentiation Algorithms Based on Batch-Processing and Precomputation (Special Section on Cryptography and Information Security)
• A Signed Binary Window Method for Fast Computing over Elliptic Curves (Special Section on Cryptography and Information Security)
• Computing Short Lucas Chains for Elliptic Curve Cryptosystems (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク