### 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 - 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 |

### 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 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science Applications
- Software

### Cite this

*Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012*(pp. 504-507). [6530387]

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings - 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012.*, 6530387, pp. 504-507, 2012 7th International Conference on Computing and Convergence Technology (ICCIT, ICEI and ICACT), ICCCT 2012, Seoul, Korea, Republic of, 12/3/12.

}

TY - GEN

T1 - The power root calculation for the exponentiation inversion problem

AU - Sumo, Taichi

AU - Nogami, Yasuyuki

PY - 2012

Y1 - 2012

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

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

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

M3 - Conference contribution

AN - SCOPUS:84881185774

SN - 9788994364216

SP - 504

EP - 507

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

ER -