On Secure and Fast Elliptic Curve Cryptosystems over F_p

スポンサーリンク

概要

• 論文の詳細を見る

• From a practical point of view, a cryptosystem should require a small key size and less running time. For this purpose, we often select its definition field in such a way that the arithmetic can be implemented fast. But it often brings attacks which depend on the definition field. In this paper, we investigate the definition field F_p on which elliptic curve cryptosystems can be implemented fast, while maintaining the security. The expected running time on a general construction of many elliptic curves with a given number of rational points is also discussed.

• 一般社団法人電子情報通信学会の論文
• 1994-04-25

著者

• Miyaji Atsuko

  Matsushita Electric Industrial Co. Ltd.

関連論文

• Another Countermeasure to Forgeries over Message Recovery Signature
• Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem
• Elliptic Curves Suitable for Cryptosystems
• On Secure and Fast Elliptic Curve Cryptosystems over F_p

スポンサーリンク