An Efficient Scalar Multiplication Algorithm on Montgomery-Form Elliptic Curve

PANG Shi-chun; LIU Shu-fen; CONG Fu-zhong; YAO Zhi-lin

您当前的位置：

首页 >

文章列表页 >

An Efficient Scalar Multiplication Algorithm on Montgomery-Form Elliptic Curve

更新时间：2025-07-16

- An Efficient Scalar Multiplication Algorithm on Montgomery-Form Elliptic Curve
- Acta Electronica Sinica Vol. 39, Issue 4, Pages: 865-868(2011)
- 作者机构：
  
  1. 吉林大学计算机科学与技术学院,吉林,长春,130022
  2. 空军航空大学基础部,吉林,长春,130012
  3. 吉林大学计算机科学与技术学院吉林长春,130022
  4. 空军航空大学基础部吉林长春,130012
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP301.6
- Published：2011
- 稿件说明：
移动端阅览
PANG Shi-chun, LIU Shu-fen, CONG Fu-zhong, et al. An Efficient Scalar Multiplication Algorithm on Montgomery-Form Elliptic Curve[J]. Acta Electronica Sinica, 2011, 39(4): 865-868.
DOI：

PANG Shi-chun, LIU Shu-fen, CONG Fu-zhong, et al. An Efficient Scalar Multiplication Algorithm on Montgomery-Form Elliptic Curve[J]. Acta Electronica Sinica, 2011, 39(4): 865-868. DOI：

摘要

椭圆曲线标量乘法是椭圆曲线密码系统的基本运算

安全高效的标量乘法将直接提高椭圆曲线密码系统的效率和安全性.本文将Fibonacci数列的概念进行了扩展

提出了Fibonacci型数列的概念

并用Fibonacci型数列将Montgomery型曲线上点的加法运算公式进行了简化

得到了新的点加公式fibAdd.利用黄金比率加法链方法计算任意整数k的Fibonacci型数列.将二种方法结合

构造了Montgomery型曲线上任意整数k的标量乘算法.本文提出的算法比GRAC-258快23%

在最优情况下比EAC-320快39%

同时

由于本算法只需要进行点的加法运算

不需要进行倍点运算

因而本算法天然地具有对抗边信道攻击的特性.

Abstract

Elliptic curve scalar multiplication is a basic operation of elliptic curve cryptosystem.Secure and efficient scalar multiplication algorithm will directly promote efficiency and security of elliptic curve cryptosystem.In this paper

the concept of Fibonacci series is extended and proposed

which is used to simplify point addition formula on Montgomery-Form elliptic curve and to get a new point addition formula fibAdd.The Fibonacci-type series of any positive integer k is computed by using Golden Ratio Addition Chain method.By combing of both methods

the paper constructs an efficient and secure scalar multiplication algorithm for any given integer k on Montgomery-Form elliptic curve is constructed.This new algorithm is 23% faster than GRAC-258 and is 39% faster than EAC-320 in the best case.Also

because the algorithm performs only point addition operation

and there is no need for doubling operation

it possesses naturally the ability to resist side channel attack.

关键词

Keywords

references

Views

1251

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Markov-Chain Based Performance Analysis Method for Scalar Multiplication on Elliptic Curve

A Selection of the Secure Elliptic Curve and Fast Calculation of Scalar Multiplication

Related Author

BAO Wan-su

CHEN Hui

TANG Wen

TANG Li-yong

CHEN Zhong

BAI Guo-qiang

ZHOU Tao

CHEN Hong-yi

Related Institution

Institute of Electronic Technology, the PLA Information Engineering University

School of Electronic Engineering and Computer Science,Peking University

Institute of Microelectronics,Tsinghua Univ.

Department of Mathematics,Xi'an Jiaotong Univ.

Institute of MicroelectronicsTsinghua Univ.Beijing 100084China

⁰