Presentation 2015-03-02
Efficient Calculation of Pairing with Supersingular Curve on 2-dimentional Extension Field
Akito KUMANO, Yasuyuki NOGAMI, Masaaki SHIRASE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Yoshida et al. have proposed the vector decomposition problem using supersingular curve whose embedding degree is 2. In order to apply the problem as a trapdoor of cryptosystem, it is necessary to speed up pairing calculations. This paper considers an efficient approach for Tate pairing with a supersingular curve on 2-dimentional extension field. This paper improves both Miller's algorithm and final exponentiation that is required for Tate pairing. In detail, one multiplication in the calculation of Miller's loop is eliminated by using twist map. This paper discusses how efficient the calculation of pairing becomes.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) pairing / supersingular curve
Paper # IT2014-64,ISEC2014-77,WBS2014-56
Date of Issue

Conference Information
Committee ISEC
Conference Date 2015/2/23(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) Efficient Calculation of Pairing with Supersingular Curve on 2-dimentional Extension Field
Sub Title (in English)
Keyword(1) pairing
Keyword(2) supersingular curve
1st Author's Name Akito KUMANO
1st Author's Affiliation Okayama University()
2nd Author's Name Yasuyuki NOGAMI
2nd Author's Affiliation Okayama University
3rd Author's Name Masaaki SHIRASE
3rd Author's Affiliation Future University Hakodate
Date 2015-03-02
Paper # IT2014-64,ISEC2014-77,WBS2014-56
Volume (vol) vol.114
Number (no) 471
Page pp.pp.-
#Pages 7
Date of Issue