Cryptosystems using pairing computation on elliptic curves have various applications including ID-based encryption (, ,  etc.). Scott  proposed a scaling method of security by a change of the embedding degree k. On the other hand, he also presented an efficient pairing computation method on an ordinary (non-supersingular) elliptic curve over a large prime field <Fopf>p (). In this paper, we present an implementation method of the pairing computation with both of the security scaling in  and the efficiency in . First, we will investigate the mathematical nature of the set of the paremeter r (the order of cyclic group used) so as to support many k's. Then, based on it, we will suggest some modification to the algorithm of Scott in  to achieve flexible scalability of security level.
|ジャーナル||IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences|
|出版ステータス||Published - 2007 1月|
ASJC Scopus subject areas
- コンピュータ グラフィックスおよびコンピュータ支援設計