James Donald writes:
On Tue, Feb 26, 2002 at 02:04:16AM -, Frog3 wrote:
The cost [To factor RSA 1024] is the need to build a
machine that can do 53 billion simultaneous, independent
ECM factorizations for smoothness testing. It's not clear
how amenable this would be to hardware
David Wagner writes:
Bernstein's analysis is based on space*time as your cost metric.
What happens if we assume that space comes for free, and we use simply
time as our cost metric? Do his techniques lead to an improvement in
this case?
Bernstein basically treats memory and processing
More analysis of Dan Bernstein's factoring machine from
http://cr.yp.to/papers.html#nfscircuit;
The NFS algorithm has two phases. The first searches for coefficients
(a,b) from some interval which are relatively prime and which satisfy
two smoothness bounds. The smoothness is with respect to a
Very interesting. Thanks for the analysis.
Bernstein's analysis is based on space*time as your cost metric.
What happens if we assume that space comes for free, and we use simply
time as our cost metric? Do his techniques lead to an improvement in
this case?
It looks to me like there is no
