Presentation 2010-07-02
On the examination on speeding Cheon's algorithm
Masaya YASUDA, Tetsuya IZU, Masahiko TAKENAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The security of many cryptographic systems is based on the hardness of the discrete logarithm problem (DLP). In 2006, Cheon proposed an algorithm for solving DLP with auxiliary input, whcich works better than conventional algorithms. In recent years, we reported experimental results on Cheon's algorithm for DLP on an elliptic curve used for pairing-based cryptography. In this paper, we explain some methods of speeding Cheon's algorithm, which were not used in our past experiment. We also describe the effect of speeding Cheon's algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Cheon's algorithm / (elliptic curve) discrete logarithm problem / λ-method / BSGS-method
Paper # ISEC2010-33,SITE2010-29,ICSS2010-39
Date of Issue

Conference Information
Committee ICSS
Conference Date 2010/6/24(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 and Communication System Security (ICSS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On the examination on speeding Cheon's algorithm
Sub Title (in English)
Keyword(1) Cheon's algorithm
Keyword(2) (elliptic curve) discrete logarithm problem
Keyword(3) λ-method
Keyword(4) BSGS-method
1st Author's Name Masaya YASUDA
1st Author's Affiliation Fujitsu LABORATORIES LTD.()
2nd Author's Name Tetsuya IZU
2nd Author's Affiliation Fujitsu LABORATORIES LTD.
3rd Author's Name Masahiko TAKENAKA
3rd Author's Affiliation Fujitsu LABORATORIES LTD.
Date 2010-07-02
Paper # ISEC2010-33,SITE2010-29,ICSS2010-39
Volume (vol) vol.110
Number (no) 115
Page pp.pp.-
#Pages 8
Date of Issue