Montgomery algorithm on elliptic curves over finite fields of character three
|更新时间:2024-10-14
|
Montgomery algorithm on elliptic curves over finite fields of character three
Issue 10, Pages: 25-29(2008)
作者机构:
1. 中国科学院研究生院信息安全国家重点实验室
2. 中国科学技术大学电子工程与信息科学系
作者简介:
基金信息:
DOI:
CLC:TN918.1
Published:2008
稿件说明:
移动端阅览
WANG Hong1, LI Bao1, YU Wei2. Montgomery algorithm on elliptic curves over finite fields of character three[J]. 2008, (10): 25-29.
DOI:
WANG Hong1, LI Bao1, YU Wei2. Montgomery algorithm on elliptic curves over finite fields of character three[J]. 2008, (10): 25-29.DOI:
Montgomery algorithm on elliptic curves over finite fields of character three
摘要
研究了Montgomery算法在特征3有限域上椭圆曲线的应用。根据Montgomery算法的结构
省去y坐标的计算
提出新的点加和倍点计算公式
加快点乘计算速度。经过理论分析和实验验证
提出的点加和倍点计算公式可节省约15%的运算时间。
Abstract
Application of Montgomery algorithm on elliptic curves defined over finite fields of character three was re-searched.Due to the structure of Montgomery algorithm
y-coordinate was ignored
a new formula to compute point ad-dition and point doubling was proposed to accelerate the scalar point multiplication.According to theoretical analysis and experimental verification