Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3

スポンサーリンク

概要

• 論文の詳細を見る

• Pairing-based cryptosystems are generally constructed using many functions such as pairing computation, arithmetic in finite fields, and arithmetic on elliptic curves. MapToPoint, which is a hashing algorithm 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 ηT pairing. The first is computed by using a square root computation in F3m, and the computational cost of this algorithm is O(log m) multiplications in F3m. The second is computed by using an (m-1)×(m-1) matrix over F3. It can be computed by O(1) multiplications in F3m. 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 elliptic curves in characteristic three by using 1/3-trace over F3m. We propose 1/3-trace over F3m, which can compute solution x of x3-x=c by using no multiplication in F3m. The proposed algorithm is computed by O(1) multiplications in F3m, and it requires less than m F3-elements to be stored in the off-line memory to efficiently compute trace over F3m. Moreover, in our software implementation of F3509, the proposed MapToPoint algorithm is approximately 35% faster than the conventional MapToPoint algorithm using the square root computation on an AMD Opteron processor (2.2GHz).

著者

• KAWAHARA Yuto

  Future University-Hakodate

• KOBAYASHI Tetsutaro

  NTT Information Sharing Platform Laboratories, NTT Corporation

• TAKAHASHI Gen

  NTT Information Sharing Platform Laboratories, NTT Corporation

• TAKAGI Tsuyoshi

  Future University-Hakodate

関連論文

• Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
• Candidate One-Way Functions on Non-Supersingular Elliptic Curves(Elliptic Curve Cryptography, Cryptography and Information Security)
• Non-Supersingular Elliptic Curves for Pairing-Based Cryptosystems(Discrete Mathematics and Its Applications)
• Efficient Implementation of the Pairing on Mobilephones Using BREW
• Defeating Simple Power Analysis on Koblitz Curves(Discrete Mathematics and Its Applications)
• Security Analysis of the SPA-Resistant Fractional Width Method(Elliptic Curve Cryptography, Cryptography and Information Security)
• A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems(Discrete Mathematics and Its Applications)
• Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3

スポンサーリンク