IEICE TRANSACTIONS on Fundamentals
Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem
Summary :
In 1990, Menezes, Okamoto and Vanstone proposed a method that reduces EDLP to DLP, which gave an impact on the security of cryptosystems based on EDLP. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E76-A No.1 pp.50-54
- Publication Date
- 1993/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- 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, "Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E76-A, no. 1, pp. 50-54, January 1993, doi: .
Abstract: In 1990, Menezes, Okamoto and Vanstone proposed a method that reduces EDLP to DLP, which gave an impact on the security of cryptosystems based on EDLP. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e76-a_1_50/_p
Copy
@ARTICLE{e76-a_1_50,
author={Atsuko MIYAJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem},
year={1993},
volume={E76-A},
number={1},
pages={50-54},
abstract={In 1990, Menezes, Okamoto and Vanstone proposed a method that reduces EDLP to DLP, which gave an impact on the security of cryptosystems based on EDLP. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Elliptic Curve Cryptosystems Immune to Any Reduction into the Discrete Logarithm Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 50
EP - 54
AU - Atsuko MIYAJI
PY - 1993
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E76-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 1993
AB - In 1990, Menezes, Okamoto and Vanstone proposed a method that reduces EDLP to DLP, which gave an impact on the security of cryptosystems based on EDLP. But this reducing is valid only when Weil pairing can be defined over the m-torsion group which includes the base point of EDLP. If an elliptic curve is ordinary, there exists EDLP to which we cannot apply the reducing. In this paper, we investigate the condition for which this reducing is invalid.
ER -
English
