Presentation 2000/9/22
Cyclic Window Method Applied to Elliptic Curve Cryptosystems
Kazumaro Aoki, Tetsutaro Kobayashi, Fumitaka Hoshino,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper presents a new sliding window algorithm that is well-suited for an elliptic curve defined over an extension field for which the Frobenius map can be computed quickly, for example, OEF. The algorithm reduces elliptic curve group operations by approximately 15% for scalar multiplication calculations for a practically used curve in comparison with Lim-Hwang's results presented at PKC2000 that is the best previously known. We implemented the algorithm on computers. As a result, scalar multiplication can be accomplished in 571μs, 595μs, or 254μs on a Pentium II (450MHz), 21164A(500MHz), or 21264(500MHz) computer, respectively.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) cyclic window method / optimal extension field / base-φ expansion / elliptic curve cryptosystem
Paper # ISEC2000-75
Date of Issue

Conference Information
Committee ISEC
Conference Date 2000/9/22(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) Cyclic Window Method Applied to Elliptic Curve Cryptosystems
Sub Title (in English)
Keyword(1) cyclic window method
Keyword(2) optimal extension field
Keyword(3) base-φ expansion
Keyword(4) elliptic curve cryptosystem
1st Author's Name Kazumaro Aoki
1st Author's Affiliation NTT Laboratories()
2nd Author's Name Tetsutaro Kobayashi
2nd Author's Affiliation NTT Laboratories
3rd Author's Name Fumitaka Hoshino
3rd Author's Affiliation NTT Laboratories
Date 2000/9/22
Paper # ISEC2000-75
Volume (vol) vol.100
Number (no) 324
Page pp.pp.-
#Pages 8
Date of Issue