安全的并行椭圆曲线Montgomery阶梯算法

J4 ›› 2011, Vol. 49 ›› Issue (04): 690-692.

安全的并行椭圆曲线Montgomery阶梯算法

左平^1,2, 庞世春^1,2, 华宏图², 高顺川², 陈守东¹

1. 吉林大学商学院, 长春 130012|2. 空军航空大学基础部, 长春 130022

收稿日期:2010-12-10 出版日期:2011-07-26 发布日期:2011-08-16
通讯作者: 陈守东 E-mail:chensd@jlu.edu.cn

Secure and Parallel Montgomery Ladder Algorithm of ECC

ZUO Ping^1,2, PANG Shichun^1,2, HUA Hongtu², GAO Shunchuan², CHEN Shou dong¹

1. College of Business, Jilin University, Changchun 130012, China;
2. Department of Foundation, Aviation University of Air Force, Changchun 130022, China

Received:2010-12-10 Online:2011-07-26 Published:2011-08-16
Contact: CHEN Shou dong E-mail:chensd@jlu.edu.cn

摘要/Abstract

摘要：

提出一种安全高效、并行的Montgomery阶梯算法计算椭圆曲线标量乘法, 该算法继承了经典Montgomery阶梯算法能对抗简单边信道攻击的特性, 采用并行和y坐标恢复技术, 进一步提高了算法的实现效率, 算法的运算时间为［(4M+2S)+(3M+2S)］×t+12M+S.

关键词: 椭圆曲线标量乘法；边信道攻击； Montgomery阶梯算法

Abstract:

The paper proposes a secure and efficient Montgomery ladder algorithm for elliptic curve scalar multiplication computation. The algorithm inherits secure feature of resisting side channel analysis from basic Montgomery ladder algorithm. Meanwhile, the implementation efficiency is improved by paralleling and ycoordinate recovery technique. The running time of the algorithm is ［(4M+2S)+(3M+2S)］×t+12M+S.

Key words: elliptic curve scalar multiplication, side channel attack, Montgomery ladder algorithm

中图分类号:

O241.6

左平, 庞世春, 华宏图, 高顺川, 陈守东. 安全的并行椭圆曲线Montgomery阶梯算法[J]. J4, 2011, 49(04): 690-692.

ZUO Beng, LONG Shi-Chun, HUA Hong-Tu, GAO Shun-Chuan, CHEN Shou-Dong. Secure and Parallel Montgomery Ladder Algorithm of ECC[J]. J4, 2011, 49(04): 690-692.

[1]	周硕, 王霖, 王雯. 矩阵方程组(AX=B, XC=D)的Hermitian反自反（反Hermitian反自反）最小二乘解及其最佳逼近[J]. J4, 2012, 50(05): 875-880.
[2]	刘播, 刘凤楠. 一种多项式预处理算法[J]. J4, 2012, 50(01): 11-14.