A Parallel Probabilistic Approach to Factorize a Semiprime  

作　　者：Jianhui Li 

机构地区：[1]Department of Computer Science, Guangdong Neusoft Institute Foshan City, Foshan, China [2]State Key Laboratory of Mathematical Engineering and Advanced Computing, Wuxi, China

出　　处：《American Journal of Computational Mathematics》2018年第2期175-183,共9页美国计算数学期刊（英文）

摘　　要：In accordance with the distributive traits of semiprimes’ divisors, the article proposes an approach that can find out the small divisor of a semiprime by parallel computing. The approach incorporates a deterministic search with a probabilistic search, requires less memory and can be implemented on ordinary multicore computers. Experiments show that certain semiprimes of 27 to 46 decimal-bits can be validly factorized with the approach on personal computer in expected time.In accordance with the distributive traits of semiprimes’ divisors, the article proposes an approach that can find out the small divisor of a semiprime by parallel computing. The approach incorporates a deterministic search with a probabilistic search, requires less memory and can be implemented on ordinary multicore computers. Experiments show that certain semiprimes of 27 to 46 decimal-bits can be validly factorized with the approach on personal computer in expected time.

关 键 词：PARALLEL PROBABILISTIC INTEGER FACTORIZATION SEMIPRIME 

分 类 号：O1[理学—数学]