The power root calculation for the exponentiation inversion problem

Taichi Sumo, Yasuyuki Nogami

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 apply to EI problem.

Original languageEnglish
Title of host publicationProceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012
Pages504-507
Number of pages4
Publication statusPublished - Dec 1 2012
Event2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 - Seoul, Korea, Republic of
Duration: Dec 3 2012Dec 5 2012

Publication series

NameProceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012

Other

Other2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012
CountryKorea, Republic of
CitySeoul
Period12/3/1212/5/12

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'The power root calculation for the exponentiation inversion problem'. Together they form a unique fingerprint.

  • Cite this

    Sumo, T., & Nogami, Y. (2012). The power root calculation for the exponentiation inversion problem. In Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 (pp. 504-507). [6530387] (Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012).