Geek Answers Handbook

Parallelization of factorization Pollard-Ro

I recently came across an article on parallelization of the Pollard Roe algorithm , and given my particular application, in addition to the fact that I have not reached the required level of mathematics, I am wondering if this particular parallelization method helps in my particular case.

I am trying to find two factors - half-feather - of a very large number. My assumption, based on the fact that I understand little from the article, is that this parallelization works well on a number with many smaller factors, and not on two very large factors.

It's true? Should I use this parallelization or use something else? Should I use Pollard Rho or is it better to parallelize another factorization algorithm?

+5
source share
2 answers

- , . , 1000 10000, ; . : ( ). , , , . -1, . , , , .

rho, , . , , . , -.

mersenneforum.org .

+4

:

Number                Original code      Brent modification
18446744073709551617  26 ms              5 ms
10023859281455311421  109 ms             31 ms

, . ( "" , 4-6 ), , . , , , " " , . , 1, , .

: , - , , , . , , - (, Pollard-Rho 5-31 , 15-17 ) - 2 " ".

, Python.

+6

More articles:


All Articles