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

计算机工程 ›› 2011, Vol. 37 ›› Issue (6): 135-137. doi: 10.3969/j.issn.1000-3428.2011.06.047

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

GPU上ECM的快速实现

王 雷,赵 龙,韩文报   

  1. (解放军信息工程大学信息工程学院,郑州 450002)
  • 出版日期:2011-03-20 发布日期:2011-03-29
  • 作者简介:王 雷(1983-),男,硕士研究生,主研方向:密码学;赵 龙,博士研究生;韩文报,教授
  • 基金资助:
    国家“863”计划基金资助重点项目“新概念高性能计算机体系结构与系统研制”(2009AA012201)

Rapid Implementation of Elliptic Curve Methods of Factorization on Graphic Processing Unit

WANG Lei, ZHAO Long, HAN Wen-bao   

  1. (Institute of Information Engineering, PLA Information Engineering University, Zhengzhou 450002, China)
  • Online:2011-03-20 Published:2011-03-29

摘要: 针对ECM算法在图形处理单元上的实现问题,通过在GeFore9800GTX+显卡上采用Montgomery曲线的点坐标表示,并行实现大数长度为112 bit的ECM算法,选择第1阶段界为8 192,每秒可以验证1 251条曲线。该实现为RSA768数域筛法的剩余因子分解提供了实验支持。

关键词: ECM算法, 图形处理单元, Montgomery曲线

Abstract: In order to realize Elliptic Curve Methods of factorization(ECM) on Graphic Processing Unit(GPU), this paper uses Montgomery curve spot coordinate expression to implement the ECM of large number with length of 112 bit on GeFore9800GTX+ card parallel. Its speed can achieve 1 251 curves per second with bound 8 192 in the first stage confirms. The implementation provides an experimental support to the factorization of surplus factors in NFS of RSA768.

Key words: Elliptic Curve Methods of factorization(ECM), Graphic Processing Unit(GPU), Montgomery curve

中图分类号: