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 条

[1] [Anonymous], LECT NOTES COMPUTER
[2] [Anonymous], P SCIS 2000
[3] [Anonymous], ALGEBRAIC ASPECTS CR
[4] Efficient pairing computation on supersingular Abelian varieties
Barreto, Paulo S. L. M.
Galbraith, Steven D.
O'hEigeartaigh, Colm
Scott, Michael
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) : 239 - 271
[5] Barreto PSLM, 2002, LECT NOTES COMPUT SC, V2442, P354
[6] Identity-based encryption from the Weil pairing
Boneh, D
Franklin, M
[J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (03) : 586 - 615
[7] Boneh D., 2001, INT C THEORY APPL CR, V2248, P514, DOI 10.1007/3-540-45682-130
[8] Devegili AJ, 2007, LECT NOTES COMPUT SC, V4575, P197
[9] Duursma I, 2003, LECT NOTES COMPUT SC, V2894, P111
[10] A Taxonomy of Pairing-Friendly Elliptic Curves
Freeman, David
Scott, Michael
Teske, Edlyn
[J]. JOURNAL OF CRYPTOLOGY, 2010, 23 (02) : 224 - 280

← 1 2 3 →