Presentation 2022-07-20
An Efficient Sparse Multiplication Algorithm For Pairing-Friendly Elliptic Curves With Cubic Twist
Daiki Hayashida, Kenichiro Hayasaka, Tadanori Teruya,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose an efficient sparse multiplication algorithm on elliptic curves with cubic twist based on the Toom-Cook method. The multiplication algorithm we propose reduces the complexity by reducing the number of addition operations on the extension field to the number of constant multiplication on the prime field. We give a new technique that enables the application of the sparse multiplication algorithm regardless of which coefficient is sparse in the Miller loop.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Pairing-based cryptography / Miller loop / sparse multiplication / Toom-Cook method
Paper # ISEC2022-26,SITE2022-30,BioX2022-51,HWS2022-26,ICSS2022-34,EMM2022-34
Date of Issue 2022-07-12 (ISEC, SITE, BioX, HWS, ICSS, EMM)

Conference Information
Committee EMM / BioX / ISEC / SITE / ICSS / HWS / IPSJ-CSEC / IPSJ-SPT
Conference Date 2022/7/19(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Online
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Ryoichi Nishimura(NICT) / Hitoshi Imaoka(NEC) / Noboru Kunihiro(Tsukuba Univ.) / Takushi Otani(Kibi International Univ.) / Katsunari Yoshioka(Yokohama National Univ.) / Makoto Nagata(Kobe Univ.)
Vice Chair Kotaro Sonoda(Nagasaki Univ.) / Masatsugu Ichino(Univ. of Electro-Comm.) / Norihiko Okui(KDDI Research) / Naoyuki Takada(SECOM) / Junji Shikata(Yokohama National Univ.) / Goichiro Hanaoka(AIST) / Soichiro Morishita(Cyber Agent) / Takeo Tatsumi(Open Univ. of Japan) / Takahiro Kasama(NICT) / Yuichi Hayashi(NAIST) / Daisuke Suzuki(Mitsubishi Electric)
Secretary Kotaro Sonoda(Kaishi Professional Univ.) / Masatsugu Ichino(Chiba Univ.) / Norihiko Okui(NEC) / Naoyuki Takada(MitsubishiElectric) / Junji Shikata(AIST) / Goichiro Hanaoka(Ibaraki Univ.) / Soichiro Morishita(NRI-Secure) / Takeo Tatsumi(Hokuriku Univ.) / Takahiro Kasama(KDDI labs.) / Yuichi Hayashi(Okayama Univ.) / Daisuke Suzuki(SSS) / (NAIST)
Assistant Tomoko Kajiyama(Hiroshima City Univ.) / Shieyuki Sakazawa(Osaka Inst. of Tech.) / Hiroyuki Suzuki(Gunma Univ) / Shinichi Shirakawa(Yokohama National Univ.) / Yoshikazu Hanatani(Toshiba) / Yusuke Tachibana(Fukuoka Inst. of Tech.) / Keisuke Kito(Mitsubishi Electric) / Takeshi Sugawara(Univ. of Electro-Comm.) / Yo Kanemoto(NTT)

Paper Information
Registration To Technical Committee on Enriched MultiMedia / Technical Committee on Biometrics / Technical Committee on Information Security / Technical Committee on Social Implications of Technology and Information Ethics / Technical Committee on Information and Communication System Security / Technical Committee on Hardware Security / Special Interest Group on Computer Security / Special Interest Group on Security Psychology and Trust
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient Sparse Multiplication Algorithm For Pairing-Friendly Elliptic Curves With Cubic Twist
Sub Title (in English)
Keyword(1) Pairing-based cryptography
Keyword(2) Miller loop
Keyword(3) sparse multiplication
Keyword(4) Toom-Cook method
1st Author's Name Daiki Hayashida
1st Author's Affiliation Mitsubishi Electric Corporation(Mitsubishi Electric Corp.)
2nd Author's Name Kenichiro Hayasaka
2nd Author's Affiliation Mitsubishi Electric Corporation(Mitsubishi Electric Corp.)
3rd Author's Name Tadanori Teruya
3rd Author's Affiliation National Institute of Advanced Industrial Science and Technology(AIST)
Date 2022-07-20
Paper # ISEC2022-26,SITE2022-30,BioX2022-51,HWS2022-26,ICSS2022-34,EMM2022-34
Volume (vol) vol.122
Number (no) ISEC-122,SITE-123,BioX-124,HWS-125,ICSS-126,EMM-127
Page pp.pp.110-117(ISEC), pp.110-117(SITE), pp.110-117(BioX), pp.110-117(HWS), pp.110-117(ICSS), pp.110-117(EMM),
#Pages 8
Date of Issue 2022-07-12 (ISEC, SITE, BioX, HWS, ICSS, EMM)