Faster maptopoint on supersingular elliptic curves in characteristic 3

Yuto Kawahara, Tetsutaro Kobayashi, Gen Takahashi, Tsuyoshi Takagi

研究成果: ジャーナルへの寄稿学術誌査読

3 被引用数 (Scopus)


Pairing-based cryptosystems are generally constructed us ing many functions such as pairing computation, arithmetic in finite fields, and arithmetic on elliptic curves. MapToPoint, which is a hashing algo rithm onto an elliptic curve point, is one of the functions for constructing pairing-based cryptosystems. There are two MapToPoint algorithms on supersingular elliptic curves in characteristic three, which is used by qy pairing. The first is computed by using a square root computation in IF and the computational cost of this algorithm is 0(log m) multiplications in F The second is computed by using an (m-1) × (m - 1) matrix over F It can be computed by O(1) multiplications in F However, this algorithm needs the off-line memory to store about m F3m -elements. In this paper, we propose an efficient MapToPoint algorithm on the supersingular ellip tic curves in characteristic three by using 1/3-trace over F3m We propose 1/3-trace over F3m which can compute solution x of x - x = c by using no multiplication in F3m The proposed algorithm is computed by O(1) multi plications in F 3m and it requires less than rn F3m -elements to be stored in the off-line memory to efficiently compute trace over F3m Moreover, in our software implementation of F 3m the proposed MapToPoint algorithm is approximately 35% faster than the conventional MapToPoint algorithm us ing the square root computation on an AMD Opteron processor (2.2 GHz).

ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
出版ステータス出版済み - 1月 2011

!!!All Science Journal Classification (ASJC) codes

  • 信号処理
  • コンピュータ グラフィックスおよびコンピュータ支援設計
  • 電子工学および電気工学
  • 応用数学


「Faster maptopoint on supersingular elliptic curves in characteristic 3」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。