Presentation 2008-02-28
A Study on Efficient Scalar Multiplication for Elliptic Curve Cryptosystems
Naoya TERASHIMA, Tomoko K. MATSUSHIMA, Osamu ASHIHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Efficient elliptic curve arithmetic is crucial for cryptosystems based on elliptic curves. Such cryptosystems often require computing a scalar multiple kP of a base point P. Recently, some papers propose efficient algorithms to compute λP±μQ directly for small integers λ and μ from given points P and Q. We develop some programs to find the path with the minimum cost for each scalar multiplication kP under the condition that several operations of λP±μQ can be used with relatively small costs. We have construct the minimum-cost path table in which the maximum number of k (k_) is around 10^5 (2^<18>). We also show some algorithms to compute KP where k_≪K.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) elliptic curves / scalar multiplication / addition chains / power tree / path table
Paper # IT2007-41,ISEC2007-138,WBS2007-72
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/2/21(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 Study on Efficient Scalar Multiplication for Elliptic Curve Cryptosystems
Sub Title (in English)
Keyword(1) elliptic curves
Keyword(2) scalar multiplication
Keyword(3) addition chains
Keyword(4) power tree
Keyword(5) path table
1st Author's Name Naoya TERASHIMA
1st Author's Affiliation Information Systems Engineering Dept., Polytechnic Univ.()
2nd Author's Name Tomoko K. MATSUSHIMA
2nd Author's Affiliation Information Systems Engineering Dept., Polytechnic Univ.
3rd Author's Name Osamu ASHIHARA
3rd Author's Affiliation Information Systems Engineering Dept., Polytechnic Univ.
Date 2008-02-28
Paper # IT2007-41,ISEC2007-138,WBS2007-72
Volume (vol) vol.107
Number (no) 500
Page pp.pp.-
#Pages 8
Date of Issue