1

Topic: Factorization cuda

Kind time of days. Faced necessity of implementation of factorization on GPU. Now implemented simple search in search of a zero remainder of division, provided that a generated denominator - a simple natural number. According to it, it would be desirable to learn, whether there are variants more the optimized code capable of effective multisequencing. Tried p-1 Pollarda (multisequencing for the account of a choice of a random number individually for each flow) - as that did not please.... The gain of naturally linear is not present. And here Fermat a good variant, but not parallelizable (at least I did not see such possibility) And could not find the information yet, whether there are implementations for CUDA, allowing to operate with great numbers? Thankful in advance.

2

Re: Factorization cuda

Hello, reider, you wrote: R> Also could not find the information yet, whether there are implementations for CUDA, allowing to operate with great numbers? http://gilchrist.ca/jeff/factoring/index.html

3

Re: Factorization cuda

Hello, kov_serg, you wrote: _> Hello, reider, you wrote: R>> Also could not find the information yet, whether there are implementations for CUDA, allowing to operate with great numbers? _> http://gilchrist.ca/jeff/factoring/index.html thanks. But here where for operation with great numbers I did not see the code of classes

4

Re: Factorization cuda

Hello, reider, you wrote: R> But here where the code of classes for operation with great numbers I did not see In the same place the link is: https://sourceforge.net/projects/msieve … e%20v1.53/ https://gforge.inria.fr/frs/?group_id=135 https://sourceforge.net/projects/ggnfs/ … es/0.77.1/ https://sourceforge.net/projects/yafu/files/1.34/