Scaling Security of Elliptic Curves with Fast Pairing Using Efficient Endomorphisms(Elliptic Curve Cryptography,<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Cryptosystems using pairing computation on elliptic curves have various applications including ID-based encryption ([9], [29], [30] etc.). Scott [33] 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 F_p ([34]). In this paper, we present an implementation method of the pairing computation with both of the security scaling in [33] and the efficiency in [34]. 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 [34] to achieve flexible scalability of security level.

• 一般社団法人電子情報通信学会の論文
• 2007-01-01

著者

• Takashima Katsuyuki

  Information Technology R & D Center Mitsubishi Electric Corporation

関連論文

• Practical Application of Lattice Basis Reduction Algorithm to Side-Channel Analysis on (EC)DSA(Discrete Mathematics and Its Applications)
• Scaling Security of Elliptic Curves with Fast Pairing Using Efficient Endomorphisms(Elliptic Curve Cryptography,Cryptography and Information Security)
• A New Type of Fast Endomorphisms on Jacobians of Hyperelliptic Curves and Their Cryptographic Application(Elliptic Curve Cryptography, Cryptography and Information Security)

スポンサーリンク