Koblitz ([5]) and Miller ([6]) 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.
CITATION STYLE
Miyaji, A. (1993). Elliptic curves over Fp suitable for cryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 718 LNCS, pp. 479–491). Springer Verlag. https://doi.org/10.1007/3-540-57220-1_86
Mendeley helps you to discover research relevant for your work.