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 language | English |
---|---|
Pages (from-to) | 105-111 |
Number of pages | 7 |
Journal | Journal of Next Generation Information Technology |
Volume | 4 |
Issue number | 3 |
DOIs | |
Publication status | Published - May 1 2013 |
Keywords
- Exponentiation inversion
- Pairing inversion problem
- Power root calculation
ASJC Scopus subject areas
- Computer Science(all)