大数因子分解算法综述

大数因子分解不仅是非对称加密算法RSA最直接的攻击手段，也是RSA安全性分析最关键的切入点，对其研究具有极其重要的应用和理论价值。主要概括了大数因子分解的研究现状，回顾了当前主流的大数因子分解算法，介绍了它们的基本原理和实现步骤；此外，对比分析了现有大数因子分解技术在实现和应用上的优缺点；最后分析并展望了大整数分解未来的研究趋势。...

Full description

Saved in:
Bibliographic Details
Published in计算机应用研究 Vol. 31; no. 11; pp. 3201 - 3207
Main Author 刘新星 邹潇湘 谭建龙
Format Journal Article
LanguageChinese
Published 中国科学院信息工程研究所,北京,100093%国家计算机网络应急技术处理协调中心,北京,100029 2014
Subjects
RSA
大数因子分解
安全性
非对称加密
RSA
security
large integer factorization
asymmetric encryption
非对称加密
安全性
大数因子分解
Online AccessGet full text

Cover

More Information
Summary:大数因子分解不仅是非对称加密算法RSA最直接的攻击手段，也是RSA安全性分析最关键的切入点，对其研究具有极其重要的应用和理论价值。主要概括了大数因子分解的研究现状，回顾了当前主流的大数因子分解算法，介绍了它们的基本原理和实现步骤；此外，对比分析了现有大数因子分解技术在实现和应用上的优缺点；最后分析并展望了大整数分解未来的研究趋势。
Bibliography:51-1196/TP
large integer factorization; asymme;ric encryption~. RSA~; security
LIU Xin-xing, ZOU Xiao-xiang, TAN Jian-long （1. Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100093, China; 2. National Computer Network Emergency Response Technical Team/Coordination Center of China, Beijing 100029, China）
The large integer factorization is not only the most direct attacking method against RSA asymmetric encryption algo-rithm,but also the most important point to analyze the security of RSA.Study on the large integer factorization problem is of great value for theory and practice.This paper summarized the study on of the large integer factorization problem and reviewed modern popular integer factorization algorithms,and introduced their basic prinple and implementation steps.In addition,this paper made an analysis on existing large integer factorization techniques’advantage and disadvantage of implementation and application.At last,this paper stated the future prospect of large integer fa
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2014.11.001