大整数分解算法综述  

Survey of large integer factorization algorithm

作　　者：杨江帅 Yang Jiangshuai(The 6th Research Institute of China Electronics Corporation,Beijing 100083,China)

机构地区：[1]中国电子信息产业集团有限公司第六研究所,北京100083

出　　处：《信息技术与网络安全》2018年第11期12-15,共4页Information Technology and Network Security

摘　　要：RSA是目前最有影响力和最常用的公钥加密算法,它广泛应用于各个领域,能够抵抗到目前为止已知的绝大多数密码攻击。RSA密码算法的安全性基于大整数分解的困难性,因此对大整数分解问题的深入研究具有重要的理论意义和应用价值。主要概括大整数分解的研究现状,回顾当前常用的大整数分解算法,分别详细介绍它们的基本原理以及在应用方面的优缺点,最后分析展望大整数分解的研究趋势。RSA is currently the most influential and most commonly used public key encryption algorithm.It is widely used in various fields and is resistant to most of the known attacks.The security of RSA cryptographic algorithm is based on the difficulty of large integer factorization.Therefore,the in-depth study of large integer factorization problem has important theoretical significance and application value.The article mainly summarizes the research status of large integer factorization,reviews the commonly used large integer decomposition algorithms, introduces their basic principles and their advantages and disadvantages in application,and finally analyzes the research trend of large integer factorization.

关 键 词：RSA 安全性 大整数分解 

分 类 号：TN918[电子电信—通信与信息系统]