Elliptic Curves Suitable for Cryptosystems
スポンサーリンク
概要
- 論文の詳細を見る
Koblitz and Miller proposed a method by which the group of points on an elliptic curve over a finite field can be used for the public key cryptosystems instead of a finite field. To realize signature or identification schemes by a smart card, we need less data size stored in a smart card and less computation amount by it. In this paper, we show how to construct such elliptic curves while keeping security high.
- 社団法人電子情報通信学会の論文
- 1994-01-25
著者
-
MIYAJI Atsuko
Matsushita Electric Industrial Co., LTD.
-
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