Welcome to the resource topic for 2006/427
Title:
Pairing-friendly elliptic curves with small security loss by Cheon’s algorithm
Authors: Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi
Abstract:Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a ``pairing-friendly’’ elliptic curve. After Mitsunari, Sakai and Kasahara’s traitor tracing scheme and Boneh and Boyen’s short signature scheme, many protocols based on pairing-related problems such as the q-weak Diffie-Hellman problem have been proposed. In Eurocrypt 2006, Cheon proposed a new efficient algorithm to solve pairing-related problems and recently the complexity of Cheon’s algorithm has been improved by Kozaki, Kutsuma and Matsuo. Due to these two works, an influence of Cheon’s algorithm should be considered when we construct a suitable curves for the use of a protocol based on a pairing-related problem. Among known methods for constructing pairing-friendly elliptic curves, ones using cyclotomic polynomials such as the Brezing-Weng method and the Freeman-Scott-Teske method are affected by Cheon’s algorithm. In this paper, we study how to reduce a security loss of a cyclotomic family by Cheon’s algorithm. The proposed method constructs many pairing-friendly elliptic curves with small security loss by Cheon’s algorithm suitable for protocols based on pairing-related problems.
ePrint: https://eprint.iacr.org/2006/427
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .