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

引用次数: 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.

查看原文本刊更多论文

椭圆曲线密码系统中标量乘法高效计算的w-NNAF方法

本文基于非邻接形式(NAF)表达式，给出了用除2以外的任意正整数w为底表示大正整数k的新方法。我们称这种方法为w- nnaf方法，因为表达式与NAF接近，并且以w为底。这种表达式导致所有w为底的表达式中汉明权值最小。在此基础上，提出了一种有效计算kP的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Mathematics and Computation 数学-应用数学

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.