ID | 44499 |
JaLCDOI | |
Sort Key | 6
|
FullText URL | |
Author |
Yanagi, Erika
Izuta, Tetsuya
Morikawa, Yoshitaka
|
Abstract | 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.
|
Publication Title |
Memoirs of the Faculty of Engineering, Okayama University
|
Published Date | 2011-01
|
Volume | volume45
|
Publisher | Faculty of Engineering, Okayama University
|
Start Page | 46
|
End Page | 53
|
ISSN | 1349-6115
|
NCID | AA12014085
|
Content Type |
Departmental Bulletin Paper
|
OAI-PMH Set |
岡山大学
|
language |
English
|
Copyright Holders | Copyright © by the authors
|
File Version | publisher
|
NAID | |
Eprints Journal Name | mfe
|