A w-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography

IF 3.5 2区 数学 Q1 MATHEMATICS, APPLIED Applied Mathematics and Computation Pub Date : 2005-08-05 DOI:10.1016/j.amc.2004.06.106
Yong Ding , Kwok-wo Wong , Yu-min Wang
{"title":"A w-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography","authors":"Yong Ding ,&nbsp;Kwok-wo Wong ,&nbsp;Yu-min Wang","doi":"10.1016/j.amc.2004.06.106","DOIUrl":null,"url":null,"abstract":"<div><p>Based on the non-adjacent form (NAF) expression, here we present a new method to express a large positive integer <em>k</em> with the base of any positive integer <em>w</em> other than 2. We call this method the <em>w</em>-NNAF method as the expression is near to the NAF one and with base <em>w</em><span>. This expression leads to the minimal Hamming weight of all the base </span><em>w</em> expressions. Based on the proposed expression and some existing methods, an algorithm is developed to compute <em>kP</em> efficiently.</p></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"167 1","pages":"Pages 81-93"},"PeriodicalIF":3.5000,"publicationDate":"2005-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.amc.2004.06.106","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300304004758","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 2

Abstract

Based on the non-adjacent form (NAF) expression, here we present a new method to express a large positive integer k with the base of any positive integer w other than 2. We call this method the w-NNAF method as the expression is near to the NAF one and with base w. This expression leads to the minimal Hamming weight of all the base w expressions. Based on the proposed expression and some existing methods, an algorithm is developed to compute kP efficiently.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
椭圆曲线密码系统中标量乘法高效计算的w-NNAF方法
本文基于非邻接形式(NAF)表达式,给出了用除2以外的任意正整数w为底表示大正整数k的新方法。我们称这种方法为w- nnaf方法,因为表达式与NAF接近,并且以w为底。这种表达式导致所有w为底的表达式中汉明权值最小。在此基础上,提出了一种有效计算kP的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
7.90
自引率
10.00%
发文量
755
审稿时长
36 days
期刊介绍: Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.
期刊最新文献
Controllability of piecewise linear state-delay systems Leveraging surrounding past strategies to maintain cooperation in the perverse prisoner's dilemma A learning-based sliding mode control for switching systems with dead zone An algebraic algorithm for the total least squares problem in commutative quaternionic theory Branch points of homotopies: Distribution and probability of failure
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1