このエントリーをはてなブックマークに追加
ID 44499
フルテキストURL
著者
Nogami, Yasuyuki Graduate School of Natural Science and Technology, Okayama University
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.
発行日
2011-01
出版物タイトル
Memoirs of the Faculty of Engineering, Okayama University
出版物タイトル(別表記)
岡山大学工学部紀要
45巻
出版者
Faculty of Engineering, Okayama University
開始ページ
46
終了ページ
53
ISSN
1349-6115
NCID
AA12014085
資料タイプ
紀要論文
言語
English
著作権者
Copyright © by the authors
論文のバージョン
publisher
査読
無し
Eprints Journal Name
mfe