On Mon, Mar 1, 2010 at 8:45 AM, Chris Thompson <c...@cam.ac.uk> wrote: > On Mar 1 2010, Eric Rescorla wrote: > >> [...] If a key is breakable at cost C in M months, then it's breakable >> at cost Cx in M/x months. > > This isn't true in general (although it may be sufficiently so in the > cases under discussion). In particular, not all stages of NFS factorisation > attempts are easily distributable to many small processors. The sieving > stage is, but distributing the matrix reduction stage is much harder (and > a hot research topic). > > Recommended background reading: http://eprint.iacr.org/2010/006.pdf
Yes, this is correct, but I believe it is true for the values of x under discussion. -Ekr _______________________________________________ DNSOP mailing list DNSOP@ietf.org https://www.ietf.org/mailman/listinfo/dnsop
