Generating Pairing-Friendly Elliptic Curves Using Parameterized Families
Summary :
A new method is proposed for the construction of pairing-friendly elliptic curves. For any fixed embedding degree, it can transform the problem to solving equation systems instead of exhaustive searching, thus it's more targeted and efficient. Via this method, we obtain various families including complete families, complete families with variable discriminant and sparse families. Specifically, we generate a complete family with important application prospects which has never been given before as far as we know.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.1 pp.279-282
- Publication Date
- 2018/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.279
- Type of Manuscript
- LETTER
- Category
- Cryptography and Information Security
Authors
Meng ZHANG
Peking University
Maozhi XU
Peking University
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
Meng ZHANG, Maozhi XU, "Generating Pairing-Friendly Elliptic Curves Using Parameterized Families" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 1, pp. 279-282, January 2018, doi: 10.1587/transfun.E101.A.279.
Abstract: A new method is proposed for the construction of pairing-friendly elliptic curves. For any fixed embedding degree, it can transform the problem to solving equation systems instead of exhaustive searching, thus it's more targeted and efficient. Via this method, we obtain various families including complete families, complete families with variable discriminant and sparse families. Specifically, we generate a complete family with important application prospects which has never been given before as far as we know.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.279/_p
Copy
@ARTICLE{e101-a_1_279,
author={Meng ZHANG, Maozhi XU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generating Pairing-Friendly Elliptic Curves Using Parameterized Families},
year={2018},
volume={E101-A},
number={1},
pages={279-282},
abstract={A new method is proposed for the construction of pairing-friendly elliptic curves. For any fixed embedding degree, it can transform the problem to solving equation systems instead of exhaustive searching, thus it's more targeted and efficient. Via this method, we obtain various families including complete families, complete families with variable discriminant and sparse families. Specifically, we generate a complete family with important application prospects which has never been given before as far as we know.},
keywords={},
doi={10.1587/transfun.E101.A.279},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Generating Pairing-Friendly Elliptic Curves Using Parameterized Families
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 279
EP - 282
AU - Meng ZHANG
AU - Maozhi XU
PY - 2018
DO - 10.1587/transfun.E101.A.279
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2018
AB - A new method is proposed for the construction of pairing-friendly elliptic curves. For any fixed embedding degree, it can transform the problem to solving equation systems instead of exhaustive searching, thus it's more targeted and efficient. Via this method, we obtain various families including complete families, complete families with variable discriminant and sparse families. Specifically, we generate a complete family with important application prospects which has never been given before as far as we know.
ER -
English
