At 7:54 AM -0600 7/18/09, Zooko Wilcox-O'Hearn wrote:
This involves deciding whether a 192-bit elliptic curve public key is strong
enough...
Why not just go with 256-bit EC (128-bit symmetric strength)? Is the 8 bytes
per signature the issue, or the extra compute time?
--Paul Hoffman, Director
On Sunday,2009-07-19, at 13:24 , Paul Hoffman wrote:
At 7:54 AM -0600 7/18/09, Zooko Wilcox-O'Hearn wrote:
This involves deciding whether a 192-bit elliptic curve public key
is strong enough...
Why not just go with 256-bit EC (128-bit symmetric strength)? Is
the 8 bytes per signature the
By the way, we've recently been planning our next crypto-capabilities
design for the TahoeLAFS secure distributed filesystem. This
involves deciding whether a 192-bit elliptic curve public key is
strong enough, as well as subtler and more unusual issues involving
embedding keys directly
On Jul 14, 2009, at 12:43 PM, James A. Donald wrote:
2033130
Subsequent expansions in computing power will involve breaking up
Jupiter to build really big computers, and so forth, which will slow
things down a bit.
So 144 bit EC keys should be good all the way to the singularity and
So with about 1 000 000 USD and a full year you would get 122 bits
already now and agencies have a bit more budget than this! Furthermore,
the algorithm parallelizes extremely well and can handle a batch of 100
targets at only 10 times the cost.
No it cannot handle a bunch of a hundred
Tanja Lange wrote:
So with about 1 000 000 USD and a full year you would get 122 bits
already now and agencies have a bit more budget than this! Furthermore,
the algorithm parallelizes extremely well and can handle a batch of 100
targets at only 10 times the cost.
No it cannot handle a bunch
Hi all,
We are pleased to announce that we have set a new record for the elliptic
curve discrete logarithm problem (ECDLP) by solving it over a 112-bit
finite field. The previous record was for a 109-bit prime field and
dates back from October 2002.
See for more details our announcement at
We are pleased to announce that we have set a new record for the elliptic
curve discrete logarithm problem (ECDLP) by solving it over a 112-bit
finite field. The previous record was for a 109-bit prime field and
dates back from October 2002.
First of all congratulations to the team at EPFL!
Hi all,
We are pleased to announce that we have set a new record for the elliptic
curve discrete logarithm problem (ECDLP) by solving it over a 112-bit
finite field. The previous record was for a 109-bit prime field and
dates back from October 2002. Our calculation was done on a cluster of
more
