公钥密码体制中大整数分解算法研究  

Study on Algorithms of Big Integer Factorization in Public-key Cryptosystem

作　　者：王兴波[1] 唐春明[2] 李建辉 WANG Xingbo;TANG Chunming;LI Jianhui(Foshan University,Foshan 528225,China;Guangzhou University,Guangzhou 510006,China;Foshan Polytechnic,Foshan 528137,China)

机构地区：[1]佛山科学技术学院,广东佛山528225 [2]广州大学,广东广州510006 [3]佛山职业技术学院,广东佛山528137

出　　处：《现代信息科技》2020年第16期125-133,共9页Modern Information Technology

基　　金：广东省智能制造信息安全工程技术开发中心建设基金。

摘　　要：通过对文献资料的归类分析,结合大整数分解理论和实践的具体发展,从宏观层面将大整数分解的历程划分为四个阶段并归纳出了每个阶段的基本特征,同时结合国内研究情况总结出了国内研究的特点,指出了国内外研究的差别以及国内研究的某些局限性。文章最后还介绍了最近几年新发现的基于二叉树研究方法的特色及其取得的成果,展示了一些算例并揭示了未来的相关研究方向和内容。文章可作为研究大整数分解算法的参考。Based on the classification and analysis of literature,combined with the specific development of the theory and practice of large integer decomposition,the process of large integer decomposition is divided into four stages from the macro level,and the basic characteristics of each stage are summarized.At the same time,the characteristics of domestic research are summarized based on the domestic research situation,and the differences between domestic and foreign research and some limitations of domestic research are pointed out.At the end of the paper,the characteristics and achievements of the new research method based on binary tree in recent years are introduced,and some examples are presented,and the related research directions and contents in the future are revealed.This paper can be used as a reference for studying large integer factorization algorithm.

关 键 词：计算数论 密码学 整数分解 算法 

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