A hybrid addition chain method for faster scalar multiplication

Solutions to addition chain problem can be applied to operations involving huge number such as scalar multiplication in elliptic curve cryptography. Recently, a decomposition method was introduced, with an intention to generate addition chain with minimal possible terms. Totally different from oth...

詳細記述

保存先:
書誌詳細
主要な著者: Mohamad Afendee, Mohamed, Mohamad Rushdan, Md Said
フォーマット: 論文
言語:English
出版事項: 2015
主題:
オンライン・アクセス:http://eprints.unisza.edu.my/5033/1/FH02-FIK-16-04820.pdf
http://eprints.unisza.edu.my/5033/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料