Development of Large Numbers Factorization Algorithm

被引:0
作者
Illiashenko, Oleg [1 ]
Pevnev, Vladimir [1 ]
机构
[1] Natl Aerosp Univ, Kharkiv Aviat Inst, 17 Chkalov Str, UA-61070 Kharkiv, Ukraine
来源
PROCEEDINGS OF THE 2019 10TH IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS - TECHNOLOGY AND APPLICATIONS (IDAACS), VOL. 2 | 2019年
关键词
factorization algorithms; numerical methods; primes; algorithm complexity; organization of calculations;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The paper analyzes existing factorization algorithms and classifies them. The elaboration of the factorization algorithm which allows working with both small and large numbers is presented. Whereas the replacement of operations of addition and multiplication by the operation of addition, in comparison with the existing algorithms, a large gain of time is achieved. The initiation of operation of inequality solution allows cutting up to N-1/4 of possible candidates for a single calculation step. The evaluation of the time of the algorithm was conducted. It is comparable to the best known.
引用
收藏
页码:1078 / 1081
页数:4
相关论文
共 10 条
[1]  
Crandall R., 2005, Prime Numbers: A Computational Perspective, Vsecond
[2]  
Crandall Richard, 2001, PRIME NUMBERS COMPUT, P227, DOI [10.1007/978-1-4684-9316-06, DOI 10.1007/978-1-4684-9316-06]
[3]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[4]  
DIXON JD, 1981, MATH COMPUT, V36, P255, DOI 10.1090/S0025-5718-1981-0595059-1
[5]  
Gary M. R., COMPUTERS INTRACTABI
[6]  
Guo Yike, 2002, HIGH PERFORMANCE DAT, V2
[7]   FACTORING INTEGERS WITH ELLIPTIC-CURVES [J].
LENSTRA, HW .
ANNALS OF MATHEMATICS, 1987, 126 (03) :649-673
[8]   THEOREMS ON FACTORIZATION AND PRIMALITY TESTING [J].
POLLARD, JM .
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1974, 76 (NOV) :521-528
[9]  
Pomerance C., 1982, Mathema- tisch Centrum Computational Methods in Number Theory, V154, P89
[10]  
Pomerance C., 1996, Notices Amer. Math. Soc, V43, P1473