The power root calculation for the exponentiation inversion problem

Taichi Sumo, Yasuyuki Nogami

Research output: Contribution to journal › Article

Abstract

To evaluate the security of pairing-based cryptography, it is also required to consider the pairing inversion problem. According to some previous works, the pairing inversion problem is solvable if exponentiation inversion (EI) problem is solved. This paper introduces an algorithm of power root calculation and the algorithm applies to EI problem.

Original languageEnglish
Pages (from-to)105-111
Number of pages7
JournalJournal of Next Generation Information Technology
Volume4
Issue number3
DOIs
Publication statusPublished - May 2013

Fingerprint

Cryptography

Keywords

  • Exponentiation inversion
  • Pairing inversion problem
  • Power root calculation

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

The power root calculation for the exponentiation inversion problem. / Sumo, Taichi; Nogami, Yasuyuki.

In: Journal of Next Generation Information Technology, Vol. 4, No. 3, 05.2013, p. 105-111.

Research output: Contribution to journal › Article

Sumo, T & Nogami, Y 2013, 'The power root calculation for the exponentiation inversion problem', Journal of Next Generation Information Technology, vol. 4, no. 3, pp. 105-111. https://doi.org/10.4156/jnit.vol4.issue3.13
Sumo T, Nogami Y. The power root calculation for the exponentiation inversion problem. Journal of Next Generation Information Technology. 2013 May;4(3):105-111. https://doi.org/10.4156/jnit.vol4.issue3.13
Sumo, Taichi ; Nogami, Yasuyuki. / The power root calculation for the exponentiation inversion problem. In: Journal of Next Generation Information Technology. 2013 ; Vol. 4, No. 3. pp. 105-111.
@article{41cdd4e7d40d4c10b8ecf1dcf1d6e59b,
title = "The power root calculation for the exponentiation inversion problem",
abstract = "To evaluate the security of pairing-based cryptography, it is also required to consider the pairing inversion problem. According to some previous works, the pairing inversion problem is solvable if exponentiation inversion (EI) problem is solved. This paper introduces an algorithm of power root calculation and the algorithm applies to EI problem.",
keywords = "Exponentiation inversion, Pairing inversion problem, Power root calculation",
author = "Taichi Sumo and Yasuyuki Nogami",
year = "2013",
month = "5",
doi = "10.4156/jnit.vol4.issue3.13",
language = "English",
volume = "4",
pages = "105--111",
journal = "Journal of Next Generation Information Technology",
issn = "2092-8637",
publisher = "Advanced Institute of Convergence Information Technology Research Center",
number = "3",

}

TY - JOUR

T1 - The power root calculation for the exponentiation inversion problem

AU - Sumo, Taichi

AU - Nogami, Yasuyuki

PY - 2013/5

Y1 - 2013/5

N2 - To evaluate the security of pairing-based cryptography, it is also required to consider the pairing inversion problem. According to some previous works, the pairing inversion problem is solvable if exponentiation inversion (EI) problem is solved. This paper introduces an algorithm of power root calculation and the algorithm applies to EI problem.

AB - To evaluate the security of pairing-based cryptography, it is also required to consider the pairing inversion problem. According to some previous works, the pairing inversion problem is solvable if exponentiation inversion (EI) problem is solved. This paper introduces an algorithm of power root calculation and the algorithm applies to EI problem.

KW - Exponentiation inversion

KW - Pairing inversion problem

KW - Power root calculation

UR - http://www.scopus.com/inward/record.url?scp=84880983685&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880983685&partnerID=8YFLogxK

U2 - 10.4156/jnit.vol4.issue3.13

DO - 10.4156/jnit.vol4.issue3.13

M3 - Article

AN - SCOPUS:84880983685

VL - 4

SP - 105

EP - 111

JO - Journal of Next Generation Information Technology

JF - Journal of Next Generation Information Technology

SN - 2092-8637

IS - 3

ER -

Access to Document