中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
calculation components analysis of the lattice sieve

文献类型:会议论文

作者Yang Yang ; Zeng Guang ; Wang Zheng ; Han Wenbao
出版日期2012
会议名称2012 International Conference on Intelligent System and Applied Material, GSAM 2012
会议日期January 13, 2012 - January 15, 2012
会议地点Taiyuan, Shanxi, China
关键词Field programmable gate arrays (FPGA) Intelligent systems
页码298-302
中文摘要Currently, the best known algorithm for factoring RSA modulus is the General Number Field Sieve. Through the software optimized implementation of GNFS with RSA-768, we extracted nine main calculation components from the lattice sieve. Detail descriptions and comprehensive analysis of the properties about calculation, memory and communication to the nine components were given in this paper, which makes it possible to use of a variety of computing platforms, such as CPU, FPGA, CELL, and GPU etc, to accelerate the realization of GNFS. © (2012) Trans Tech Publications.
英文摘要Currently, the best known algorithm for factoring RSA modulus is the General Number Field Sieve. Through the software optimized implementation of GNFS with RSA-768, we extracted nine main calculation components from the lattice sieve. Detail descriptions and comprehensive analysis of the properties about calculation, memory and communication to the nine components were given in this paper, which makes it possible to use of a variety of computing platforms, such as CPU, FPGA, CELL, and GPU etc, to accelerate the realization of GNFS. © (2012) Trans Tech Publications.
收录类别EI
会议录Advanced Materials Research
语种英语
ISSN号1022-6680
ISBN号9783037853689
源URL[http://ir.iscas.ac.cn/handle/311060/15713]  
专题软件研究所_软件所图书馆_会议论文
推荐引用方式
GB/T 7714
Yang Yang,Zeng Guang,Wang Zheng,et al. calculation components analysis of the lattice sieve[C]. 见:2012 International Conference on Intelligent System and Applied Material, GSAM 2012. Taiyuan, Shanxi, China. January 13, 2012 - January 15, 2012.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。