Policy-Discussion

[<Lambert.Hofstra AT ins.com>]

> Yes, that´s the "strength". But for Rainbow Tables, I think you still need 
> far
more, since you haven´t broken it already.

 
I don't think so: unlike symmetric keys where each potential bit combination 
can be used as key, with asymmetric key pairs only specific values can be 
used . These can be selected upfront (that's part of normal key pair 
generation) so you only would need to store these values, far less that the 
total solution space
 
Lambert 

________________________________

Van: 
cacert-policy-bounces AT lists.cacert.org
 namens Philipp Gühring
Verzonden: wo 5/30/2007 17:28
Aan: Policy-Discussion
Onderwerp: Re: [CAcert-Policy] How to deal with "cooperation" ?



Hi Lambert,

> Did some research: asymmetric 1024 is comparable with 72-80 bit symmetric,
> asymmetric 2048bit is comparable with 96-128bit symmetric.(
> http://www.keylength.com/en/4/ ;) So actually you need to find 2^80 or 2^128
> keys.

Yes, that´s the "strength". But for Rainbow Tables, I think you still need far
more, since you haven´t broken it already.

> However, your point still stands: it requires a huge amount of storage (
> ~10^20 Exabyte) so still not feasable

Yes.

Anyway, please tell me in case you find a source of the necessary storage
capacity ;-)

Best regards,
Philipp Gühring

_______________________________________________
Have you subscribed to our RSS News Feed yet?

CAcert-Policy mailing list
CAcert-Policy AT lists.cacert.org
http://lists.cacert.org/cgi-bin/mailman/listinfo/cacert-policy

<<winmail.dat>>