Factoring RSA type prime products
Hello James it would be nice if you gave us the timings, for your code
and algorithm using binaries from 1-50 digits. Of course prime
products of RSA type "two primes".
So we could plot out a curve and estimate how efficient both algorithm
and your algebra solution for the prime problem actually would be on a
number of RSA size.
I am no math head and i don't want to start repeat my high school
algebra all over *again*
Best regards Jonas T
.
Relevant Pages
- Re: Factoring RSA type prime products
... Of course prime ... products of RSA type "two primes". ... So we could plot out a curve and estimate how efficient both algorithm ... and your algebra solution for the prime problem actually would be on a ...
(sci.math) - Re: Factoring RSA type prime products
... Of course prime ... products of RSA type "two primes". ... So we could plot out a curve and estimate how efficient both algorithm ... and your algebra solution for the prime problem actually would be on a ...
(sci.math) - Re: Factoring RSA type prime products
... and algorithm using binaries from 1-50 digits. ... Of course prime ... products of RSA type "two primes". ... and your algebra solution for the prime problem actually would be on a ...
(sci.math) - Re: Factoring RSA type prime products
... Of course prime ... products of RSA type "two primes". ... and your algebra solution for the prime problem actually would be on a ...
(sci.math) - Re: Basically a sieve method, relation to quantum
... >> The original algorithm in my program, will, my current analysis ... It is significantly faster than what you're suggesting. ... In comparison, it could factor an RSA type number, if the theory is ... If my research holds up, and I think it will, then the basic algorithm ...
(sci.crypt) |
|
