作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (04): 137-139. doi: 10.3969/j.issn.1000-3428.2012.04.044

• 安全技术 • 上一篇    下一篇

低存储需求的快速标量乘法算法

李 忠 1,2,彭代渊 1   

  1. (1. 西南交通大学信息科学与技术学院,成都 610031;2. 宜宾学院计算机与信息工程学院,四川 宜宾 644000)
  • 收稿日期:2011-09-01 出版日期:2012-02-20 发布日期:2012-02-20
  • 作者简介:李 忠(1963-),男,副教授、博士研究生,主研方向:密码学,信息安全;彭代渊,教授、博士、博士生导师
  • 基金资助:
    四川省教育厅科研基金资助重点项目(07ZA145)

Fast Scalar Multiplication Algorithm with Low Memory Requirement

LI Zhong 1,2, PENG Dai-yuan 1   

  1. (1. School of Information Science & Technology, Southwest Jiaotong University, Chengdu 610031, China; 2. School of Computer & Information Engineering, Yibin University,Yibin 644000, China)
  • Received:2011-09-01 Online:2012-02-20 Published:2012-02-20

摘要: 在椭圆曲线密码体制(ECC)中,标量乘法的运算时间和存储资源消耗较大。为此,借助标量的2MOF表示,利用混合坐标系下直接计算2Q+P的策略,提出一种低存储需求的从左向右标量乘法算法。理论及实例分析表明,该算法的时间和空间消耗较少,能有效提高ECC在资源受限环境中的实现效率。

关键词: 椭圆曲线密码体制, 标量乘法, 混合坐标, 标量表示, 直接计算

Abstract: The scalar multiplication of Elliptic Curve Cryptosysytem(ECC) has big computational costs and memory consumption. Aiming at this problem, by means of the 2MOF representation of scalar, this paper uses the direct computation 2Q+P strategy, proposes a lower memory cost and some efficient left-to-right scalar multiplication algorithm. The analysis result indicates that this algorithm has lower computational cost and memory consumption, and can enhance the ECC’s efficiency in resource constrained environment.

Key words: Elliptic Curve Cryptosysytem(ECC), scalar multiplication, mixed coordinate, scalar representation, direct computation

中图分类号: