Presentation 2012-11-22
Efficient elliptic curve exponentiation using an improved Greedy algorithm for DBNS
Yoshio KAWAMO, Atsuko MIYAJI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The dominant operation of the Elliptic Curve Cryptgraphy is to compute the scalar multiplication (κP). The Double-Base Number System (DBNS) gives fewer non-zero digits than binary representation or NAF. This is why it is a very efficient method to compute the scalar multiplication. But existing research uses the Greedy algorithm to generate DBNS representation from scalar k, and it has a problem not to be able to generate best representation for efficient scalar multiplication, We propose an improved Greedy algorithm, which generates a suitable DBNS representation for efficient scalar multiplication.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Elliptic curve / DBNS / Scalar multiplication / efficient / fast
Paper # ISEC2012-68,LOIS2012-43
Date of Issue

Conference Information
Committee LOIS
Conference Date 2012/11/14(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 Life Intelligence and Office Information Systems (LOIS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient elliptic curve exponentiation using an improved Greedy algorithm for DBNS
Sub Title (in English)
Keyword(1) Elliptic curve
Keyword(2) DBNS
Keyword(3) Scalar multiplication
Keyword(4) efficient
Keyword(5) fast
1st Author's Name Yoshio KAWAMO
1st Author's Affiliation Japan Advanced Institute of Science and Technology()
2nd Author's Name Atsuko MIYAJI
2nd Author's Affiliation Japan Advanced Institute of Science and Technology
Date 2012-11-22
Paper # ISEC2012-68,LOIS2012-43
Volume (vol) vol.112
Number (no) 306
Page pp.pp.-
#Pages 7
Date of Issue