Zooko Wilcox-O'Hearn wrote: > I often check these benchmarks for new results: > > http://bench.cr.yp.to/results-sign.html
Looking at those benchmarks, it looks like everything faster than ecdonaldp160 can be broken in a couple of months by a single good desktop computer, so ecdonaldp160 is the fastest public key algorithm left standing of the algorithms benchmarked. Am I reading the benchmarks correctly? Random 512 products of large primes take a couple of months to factor, and log operations are usually similar, but the largest elliptic curve on which a log operation has been performed is based on a 112 bit prime field _______________________________________________ tahoe-dev mailing list [email protected] http://allmydata.org/cgi-bin/mailman/listinfo/tahoe-dev
