Presentation 2013-05-23
A Consideration on Pairing Inversion Problem of Pairing Based Cryptography with BN Curve
Yasuyuki NOGAMI, Yuki KONO, Shoichi AKAGI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) As one of problems that guarantees the security of pairing-based cryptography, pairing inversion (PI) problem is studied. Though it is still more difficult than the other discrete logarithm problems (DLPs) such as elliptic curve DLP, some recent works have reduced fixed argument pairing inversion (FAPI) ploblem to exponentiation inversion (EI) problem. According to the results, FAPI is solved if EI of exponent (p^k-1)/r is solved, where p, k, and r are the characteristic, embedding degree, and order of pairing group. This paper tries to reduce the size of exponent in the case that the pairing curve is the well-known Barreto-Naehrig (BN) curve.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) pairing inversion problem / trace / Barreto-Naehrig curve
Paper # ISEC2013-6
Date of Issue

Conference Information
Committee ISEC
Conference Date 2013/5/16(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Consideration on Pairing Inversion Problem of Pairing Based Cryptography with BN Curve
Sub Title (in English)
Keyword(1) pairing inversion problem
Keyword(2) trace
Keyword(3) Barreto-Naehrig curve
1st Author's Name Yasuyuki NOGAMI
1st Author's Affiliation Graduate school of Nature Science and Technology, Okayama University()
2nd Author's Name Yuki KONO
2nd Author's Affiliation Graduate school of Nature Science and Technology, Okayama University
3rd Author's Name Shoichi AKAGI
3rd Author's Affiliation Graduate school of Nature Science and Technology, Okayama University
Date 2013-05-23
Paper # ISEC2013-6
Volume (vol) vol.113
Number (no) 53
Page pp.pp.-
#Pages 3
Date of Issue