Presentation 2009-09-25
A note on pairing inversion problem
Naoki KANAYAMA, Eiji OKAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we show that pairing inversion problem of Ate_i pairing, a variant of Tate pairing, can be solved under some assumptions. A standard approach for inversion problem of Tate pairing (and its improved pairings) is separated two steps: (1) finding a "valid" power root (2) solving Miller inversion for the power root. If we have a generic algorithm for finding the "valid" power root, we can solve inversion problem of Ate_i pairing without solving Miller inversion by using properties of Ate_i pairing. We show that pairing inversion problem on a variant of Tate pairing, Ate_i pairing, is reduced to problem for finding a "valid" power root. So, pairing inversion problem is reduced to problem for finding a "valid" power root.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) pairing inversion problem / Tate pairing / power root computation
Paper # ISEC2009-49
Date of Issue

Conference Information
Committee ISEC
Conference Date 2009/9/18(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A note on pairing inversion problem
Sub Title (in English)
Keyword(1) pairing inversion problem
Keyword(2) Tate pairing
Keyword(3) power root computation
1st Author's Name Naoki KANAYAMA
1st Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba()
2nd Author's Name Eiji OKAMOTO
2nd Author's Affiliation Graduate School of Systems and Information Engineering, University of Tsukuba
Date 2009-09-25
Paper # ISEC2009-49
Volume (vol) vol.109
Number (no) 207
Page pp.pp.-
#Pages 8
Date of Issue