Memoirs of the Faculty of Engineering, Okayama University 45巻
2011-01 発行
Yanagi, Erika
Graduate School of Natural Science and Technology, Okayama University
Izuta, Tetsuya
Graduate School of Natural Science and Technology, Okayama University
Morikawa, Yoshitaka
Graduate School of Natural Science and Technology, Okayama University
Recently, composite order pairing–based cryptographies have received much attention. The composite order needs to be as large as the RSA modulus. Thus, they require a certain pairing–friendly elliptic curve that has such a large composite order. This paper proposes an efficient algorithm for generating an ordinary pairing–friendly elliptic curve of the embedding degree 1 whose order has two large prime factors as the RSA modulus. In addition, the generated pairing–friendly curve has an efficient structure for the Gallant–Lambert–Vanstone (GLV) method.