---------------------------------
试除法( Trial division)
--------------------------------
逆向因子分解法
--------------------------------
轮式因子分解法( Wheel factorization)
-------------------------------------
Pollard's rho算法( Pollard's rho algorithm)
---------------------------------------
代数群因子分解算法( Algebraic-group factorisation algorithms):
· Pollard's p-1算法( Pollard'sp−1 algorithm)
· Williams' p+1算法( Williams'p+1 algorithm)
· Lenstra椭圆曲线因子分解法( Lenstra elliptic curve factorization )
--------------------------------------
费尔马因子分解法( Fermat's factorization method)
--------------------------------------
欧拉因子分解法( Euler's factorization method)
--------------------------------------
Dixon's算法( Dixon's algorithm)
----------------------------------------
连分数因子分解法 ( Continued fraction factorization, CFRAC)
----------------------------------------
自然筛选法( Rational sieve)
-----------------------------------------
Quadratic Sieves(二次筛法)
--SIQS(Self-Initializing Quadratic Sieve,自初始化二次筛法)是一种高效的大整数分解算法
--MPQS算法(Multiple Polynomial Quadratic Sieve,多项式二次筛法)
----------------------------------
SQUFOF 二次剩余因子分解法( Shanks' square forms factorization, SQUFOF)
----------------------------------
平方根倍率分解法
---------------------------------
NFS (Number Field Sieve)
GNFS 普通数域筛法
SNFS (Special Number Field Sieve)特殊数域筛选法
---------------------------------
Shor算法
----------------------------------
Fast Sieve算法 ,也称为 埃拉托斯特尼筛法 (Sieve of Eratosthenes),是一种经典的算法,用于找出一定范围内的所有素数。
----------------------------------
工具:
YAFU - Quadratic Sieves (SIQS/MPQS/QS), Elliptic Curve Method (ECM), P-1, P+1, Squfof, Rho, and Fast Sieve of Eratosthenes
MSIEVE - Self-Initializing Quadratic Sieve (SIQS) and Number Field Sieve (GNFS/SNFS)
GMP-ECM - Elliptic Curve Method (ECM), P-1, P+1
GGNFS - Number Field Sieve (GNFS/SNFS)
CADO-NFS -CADO-NFS是C / C ++中数字字段筛选(NFS)算法的完整实现,用于分解整数并计算有限字段中的离散对数。网址:https://cado-nfs.gitlabpages.inria.fr/ https://gitlab.inria.fr/cado-nfs/cado-nfs
网页:
https://gilchrist.great-site.net/jeff/factoring/index.html?i=2
https://www.alpertron.com.ar/JAVAPROG.HTM