Presentation 2006-12-13
On experimental study on the application of point tripling formulas for elliptic curve cryptosystems
Kazuya OKAMOTO, Akira HAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We are concerned with a method for faster encryption and decryption of elliptic curve cryptosystems. For this purposes A. Hayashi proposed and theoretically discussed a mehtod for point multiplication using ternary or in general h-ary expansion of the multiplier n, which turned out better in some cases than the usual binary method. We report results of computer experiments, from which we found the relationship between computational time and Hamming weight of the multiplier n in the expansion form. The experimental results have shown that there are cases in which our method using ternary or quadrary expansion is better than the usual method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) elliptic curve cryptosystem / fast algorithm for point multiplication
Paper # ISEC2006-108
Date of Issue

Conference Information
Committee ISEC
Conference Date 2006/12/6(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) On experimental study on the application of point tripling formulas for elliptic curve cryptosystems
Sub Title (in English)
Keyword(1) elliptic curve cryptosystem
Keyword(2) fast algorithm for point multiplication
1st Author's Name Kazuya OKAMOTO
1st Author's Affiliation Kanazawa Institute of Technology()
2nd Author's Name Akira HAYASHI
2nd Author's Affiliation Kanazawa Institute of Technology
Date 2006-12-13
Paper # ISEC2006-108
Volume (vol) vol.106
Number (no) 411
Page pp.pp.-
#Pages 5
Date of Issue