IEICE TRANSACTIONS on Fundamentals
On Secure and Fast Elliptic Curve Cryptosystems over Fp
Summary :
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 Fp 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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.4 pp.630-635
- Publication Date
- 1994/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Atsuko MIYAJI, "On Secure and Fast Elliptic Curve Cryptosystems over Fp" in IEICE TRANSACTIONS on Fundamentals,
vol. E77-A, no. 4, pp. 630-635, April 1994, doi: .
Abstract: 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 Fp 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e77-a_4_630/_p
Copy
@ARTICLE{e77-a_4_630,
author={Atsuko MIYAJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Secure and Fast Elliptic Curve Cryptosystems over Fp},
year={1994},
volume={E77-A},
number={4},
pages={630-635},
abstract={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 Fp 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.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - On Secure and Fast Elliptic Curve Cryptosystems over Fp
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 630
EP - 635
AU - Atsuko MIYAJI
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1994
AB - 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 Fp 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.
ER -
English
