On Fri, 18 Mar 2005, Dunceor . wrote:
YOU FUCKIN IDIOT.
TURN THAT SHIT OF, THAT IS LIKE THE 10TH MAIL TODAY.
some people just don't have the brains.
Um, it's an automatically generated message. Which means spewing flames
at them isn't going to help.
Could we temporarily remove this person from
On Mon, 14 Mar 2005, Ferdinand Prantl wrote:
Hi,
you may want to read yet another paper, where a different,
faster method is introduced, than the chinese one (english):
http://cryptography.hyperlink.cz/md5/MD5_collisions.pdf
Careful. This is with MD5, a different (but still related) algorithm tha
My point exactly. We don't need to panic- but I do think we need to start
looking for alternatives.
On Mon, 14 Mar 2005, Alicia da Conceicao wrote:
Bruce Schneier said it best on his blog (dated 18 Feb 2005):
Brian
__
OpenSSL Pr
Lecture warning.
On Mon, 14 Mar 2005, alok wrote:
Yeah, you need large key sizes- 128 bits keys just aren't enough (they
allow birthday attacks to be computationally feasible). But I note that
all the AES finalists went to 256 bit key sizes. This would put a birthday
attack at about 128 bits of
On Mon, 14 Mar 2005, alok wrote:
IIRC, you can turn any private key crypto system into a hasing algorithm.
Given an encryption function c = f(k, p) where c is the resulting
ciphertext, k is the private key, and p is the plaintext, you can use it
as a hash function s' = h(t, s) where s' is the n
On Mon, 14 Mar 2005, alok wrote:
I doubt many people would actually use it if they know it can be easily
broken..
Like someone said on the list "hey everyone uses it, it must be secure" is
the mental genere.
Most people, including a depressingly large number of programmers, would
probably cons
Pardon me if I'm beating an already dead horse here. But with the recent
news on the breaking of MD-5, SHA-1, etc., I was wondering: is there a way
for OpenSSL to use symmetric key ciphers as hashing algorithms?
As I understand it, given a symmetric key cipher c = f(k,p) where c is the
ciphert
