Presentation 2002/7/12
Efficient exponentiation of Montgomery-type elliptic curves (2)
Yuichi FUTA, Motoji OHMORI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The Montgomery-type elliptic curve is known for their faster arithmetic than the Weierstrass-type elliptic curve. The dominant operation of Elliptic Curve Cryptosystem(ECC) is scalar multiplication of points on an elliptic curve, and it usually includes scalar multiplication of a fixed base point of ECC. For Weierstrass-type elliptic curves, accelerating methods, using the pre-computed table of scalar multiplication of the fixed point, are widely studied. However, such a scheme does not naturally expand to the Montgomery-type elliptic curve. In this paper, we propose fast scalar multiplication methods on Montgomery-type elliptic curves using pre-computed table for the first time. Our method is 1.6 times as fast as the known method for Montgomery-type elliptic curves.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) elliptic curve / Montgomery-type elliptic curve / exponentiation / fixed point
Paper # ISEC2002-51
Date of Issue

Conference Information
Committee ISEC
Conference Date 2002/7/12(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 exponentiation of Montgomery-type elliptic curves (2)
Sub Title (in English)
Keyword(1) elliptic curve
Keyword(2) Montgomery-type elliptic curve
Keyword(3) exponentiation
Keyword(4) fixed point
1st Author's Name Yuichi FUTA
1st Author's Affiliation Multimedia Development Center, Matsushita Electric Industrial Co., Ltd.()
2nd Author's Name Motoji OHMORI
2nd Author's Affiliation Multimedia Development Center, Matsushita Electric Industrial Co., Ltd.
Date 2002/7/12
Paper # ISEC2002-51
Volume (vol) vol.102
Number (no) 212
Page pp.pp.-
#Pages 7
Date of Issue