Jeffrey Walton-3 wrote:
>
>> 1. For how many days can I use a 512-bit key?
> 0
>
Does a individual hackers have the NASA's PC? lol, I mean I'm looking about
the integer factorization problem and, from a SW point of view, I think only
a comunity of PCs can solve the problem in few time (less than one day?!) .
Am I wrong? Or can u do it with a standard PC? :-/
I'm also getting information about special HW for for attacking
cryptographic systems. Some papers (focused on the number-field sieve)
claims to be able to hack the 512-key in less than 10 minutes, but without
an actual implementation.
Is there any real implementation who can show me how much time someone need
to factor 512-key? Do you know it? cos i would like to know the currently
lifetime (minutes? lol) of the 512-bits key.
Jeffrey Walton-3 wrote:
>
> Try an elliptic curve. It will be about 8-12 times faster than RSA,
> with a smaller signature. Since your using SHA-256, use P-256 or
> B-233.
> :)
> Jeff
>
I've already implemented the ECDSA scheme in my application: using SHA-1 and
secp160k1. Yep. I'm pretty faster on the signer's side, but i'm actually
much slower on the verification side.
Of course, with ECDSA, the lifetime of my key is quite longer, since HW
attacks appear infeasible on secp160k1. So, should i worry about an attack
on the SHA-1? or on the # of sent messages?
thanks
--
View this message in context:
http://old.nabble.com/about-the-security-of-a-tipical-client-server-application.-tp26259295p26268560.html
Sent from the OpenSSL - User mailing list archive at Nabble.com.
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List openssl-users@openssl.org
Automated List Manager majord...@openssl.org
