Presentation 2013-05-23
Improvement in Addition formula on Elliptic Curves
Yoshitaka NAGAI, Tetsuya IZU, Masaaki SHIRASE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is important to speed up scalar multiplication in elliptic curve cryptosystem and then various speeding-up techniques have been proposed. This paper shows that the cost of scalar multiplication of a base point on an elliptic curve given by Weierstrass form over a prime field is reduced using a bijective transform so that x coordinate = ±y coordinate of the base point. In fact, the cost of scalar multiplication is reduced by 2~5% in projective, Jacobian, and modified Jacobian coordinates.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) elliptic curve cryptosystem / scalar multiplication / speeding up / bijective transform
Paper # ISEC2013-7
Date of Issue

Conference Information
Committee ISEC
Conference Date 2013/5/16(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) Improvement in Addition formula on Elliptic Curves
Sub Title (in English)
Keyword(1) elliptic curve cryptosystem
Keyword(2) scalar multiplication
Keyword(3) speeding up
Keyword(4) bijective transform
1st Author's Name Yoshitaka NAGAI
1st Author's Affiliation Future University Hakodate()
2nd Author's Name Tetsuya IZU
2nd Author's Affiliation FUJITSU LABORATORIES Ltd.
3rd Author's Name Masaaki SHIRASE
3rd Author's Affiliation Future University Hakodate
Date 2013-05-23
Paper # ISEC2013-7
Volume (vol) vol.113
Number (no) 53
Page pp.pp.-
#Pages 8
Date of Issue