Forum: Factoring
2013-08-11, 17:40
|
|
Replies: 26
Views: 5,180
Ah, I see the problem with this method.
As...
Ah, I see the problem with this method.
As Silverman mentioned, xk-1+xk+r-1 == N is a possibility.
Since xk-1 = N - xk+r-1 = a, you essentially have found a pair of numbers a and -a MOD N.
It is...
|
|
Forum: Factoring
2013-08-11, 03:22
|
|
Replies: 26
Views: 5,180
|
|
Forum: Factoring
2013-08-10, 05:28
|
|
Replies: 26
Views: 5,180
Can Pollard Rho cycles be used to find a factor?
Pollard's rho algorithm uses a generator function to generate a sequence of numbers xi.
We check for factors by calculating GCD(abs(xi-x2i),N).
If the GCD = 1, we continue to the next i.
If the...
|
|
Forum: YAFU
2013-08-07, 04:37
|
|
Replies: 260
Views: 60,741
Yafu on arm cpu
Has anyone managed to get Yafu working on an arm cpu?
The code seems heavily optimized and I don't see a "generic" path for some functions.
Walter
|
|
Forum: Hardware
2013-05-12, 02:00
|
|
Replies: 5
Views: 1,323
Thanks for the information Jason.
Since I...
Thanks for the information Jason.
Since I was going for a 10x improvement, I cannot see this working.
I was managing to fit about 550K primes (primes to 8M) into the device.
This was the...
|
|
Forum: Hardware
2013-05-10, 08:27
|
|
Replies: 5
Views: 1,323
FPGA based NFS sieving
I am making some rough calculations to make a line siever in a large FPGA.
Lattice sieving does not fit well into one device. It is I/O limited due to the number of sieves set up per second.
Line...
|
