Approach to Pairing Inversions Without Solving Miller Inversion

被引：8

作者：

Kanayama, Naoki ^{[1
]}

Okamoto, Eiji ^{[1
]}

机构：

[1] Univ Tsukuba, Dept Risk Engn, Fac Syst & Informat Engn, Tsukuba, Ibaraki 3058573, Japan

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2012年 / 58卷 / 02期

关键词：

Ate(i) pairing; exponentiation inversion; Miller inversion; pairing inversion; Tate pairing; EFFICIENT; COMPUTATION; ATE;

D O I：

10.1109/TIT.2011.2173714

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In the present paper, we show that the pairing inversion problem of Ate(i) pairing can be solved under the assumption that we have a generic algorithm for solving "exponentiation inversion" problem. With such an algorithm, the inversion problem of Ate(i) pairing can be solved without solving the Miller inversion. Thus, the pairing inversion problem of Ate(i) pairing is reduced to the exponentiation inversion problem.

引用

页码：1248 / 1253

页数：6

共 29 条

[21] REDUCING ELLIPTIC CURVE LOGARITHMS TO LOGARITHMS IN A FINITE-FIELD [J].

MENEZES, AJ ;

OKAMOTO, T ;

VANSTONE, SA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (05) :1639-1646

[22]

Miller VictorS., 1986, Short programs for functions on elliptic curves

[23] The Weil pairing, and its efficient calculation [J].

Miller, VS .

JOURNAL OF CRYPTOLOGY, 2004, 17 (04) :235-261

[24]

Nogami Y, 2008, LECT NOTES COMPUT SC, V5209, P178, DOI 10.1007/978-3-540-85538-5_13

[25] A fault attack on pairing-based cryptography [J].

Page, Daniel ;

Vercauteren, Frederik .

IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (09) :1075-1080

[26]

Satoh T, 2007, LECT NOTES COMPUT SC, V4575, P317

[27]

Vercauteren F, 2008, LECT NOTES COMPUT SC, V5209, P89, DOI 10.1007/978-3-540-85538-5_6

[28] Optimal Pairings [J].

Vercauteren, Frederik .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) :455-461

[29] A note on the Ate pairing [J].

Zhao, Chang-An ;

Zhang, Fangguo ;

Huang, Jiwu .

INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2008, 7 (06) :379-382

← 1 2 3 →