Key Length Estimation of Pairing-Based Cryptosystems Using ηT Pairing over GF(3n)
スポンサーリンク
概要
- 論文の詳細を見る
The security of pairing-based cryptosystems is determined by the difficulty of solving the discrete logarithm problem (DLP) over certain types of finite fields. One of the most efficient algorithms for computing a pairing is the ηT pairing over supersingular curves on finite fields of characteristic 3. Indeed many high-speed implementations of this pairing have been reported, and it is an attractive candidate for practical deployment of pairing-based cryptosystems. Since the embedding degree of the ηT pairing is 6, we deal with the difficulty of solving a DLP over the finite field GF(36n), where the function field sieve (FFS) is known as the asymptotically fastest algorithm of solving it. Moreover, several efficient algorithms are employed for implementation of the FFS, such as the large prime variation. In this paper, we estimate the time complexity of solving the DLP for the extension degrees n=97, 163, 193, 239, 313, 353, and 509, when we use the improved FFS. To accomplish our aim, we present several new computable estimation formulas to compute the explicit number of special polynomials used in the improved FFS. Our estimation contributes to the evaluation for the key length of pairing-based cryptosystems using the ηT pairing.
著者
-
Shinohara Naoyuki
National Inst. Of Information And Communications Technol. Koganei‐shi Jpn
-
SHIMOYAMA Takeshi
FUJITSU LABORATORIES Ltd
-
TAKAGI Tsuyoshi
Kyushu University
-
HAYASHI Takuya
Kyushu University
関連論文
- Extending Bleichenbachers Forgery Attack
- A Strict Evaluation on the Number of Conditions for SHA-1 Collision Search
- A Combinatorics Proliferation Model with Threshold for Malware Countermeasure
- Theoretical Analysis of x^2 Attack on RC6 (Symmetric Cipher) (Cryptography and Information Security)
- Small Secret CRT-Exponent Attacks on Takagi's RSA
- An Efficient Interpolation Attack(Special Section on Cryptography and Information Security)
- Preimage Attacks on the Step-Reduced RIPEMD-128 and RIPEMD-160
- Key Length Estimation of Pairing-Based Cryptosystems Using ηT Pairing over GF(3n)
- Extending Bleichenbacher's Forgery Attack
- Preimage Attacks on the Step-Reduced RIPEMD-128 and RIPEMD-160