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 language | English |
|---|---|
| Title of host publication | Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 |
| Pages | 504-507 |
| Number of pages | 4 |
| Publication status | Published - Dec 1 2012 |
| Event | 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 - Seoul, Korea, Republic of Duration: Dec 3 2012 → Dec 5 2012 |
Publication series
| Name | Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 |
|---|
Other
| Other | 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012 |
|---|---|
| Country | Korea, Republic of |
| City | Seoul |
| Period | 12/3/12 → 12/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).