Hello Muli (and welcome back).
When and where are these lectures going to take place?
Thanks,
Eli
Muli Ben-Yehuda wrote:
On Tue, Aug 17, 2004 at 11:57:45AM +0200, Eli Billauer wrote:
(and sorry for not coming yesterday. I really wanted to hear the
combined lecture, but was
On Wed, Aug 18, 2004 at 11:46:29AM +0200, Eli Billauer wrote:
Hello Muli (and welcome back).
Thank you
When and where are these lectures going to take place?
Telux: Sept 5. See http://www.cs.tau.ac.il/telux/
IBM HRL: Sept 7. Contact me offlist for details.
Cheers,
Muli
--
Muli Ben-Yehuda
On Wed, 18 Aug 2004, Shachar Shemesh wrote:
Orr Dunkelman wrote:
This is true, but has no meaning. A paper to be presented tomorrow in
Santa Barbara by Antoine Joux (who found the collision in SHA-0), explains
that to attack such a scheme:
h(x) = SHA-1(x) || MD5(x)
is as hard as breaking
Orr Dunkelman wrote:
This is true, but has no meaning. A paper to be presented tomorrow in
Santa Barbara by Antoine Joux (who found the collision in SHA-0), explains
that to attack such a scheme:
h(x) = SHA-1(x) || MD5(x)
is as hard as breaking the harder between the two (under birthday
attacks).
Hi,
On 08/18/2004 04:01 PM, Shachar Shemesh wrote:
Also, I wrote a newbie friendly explanation of what happens there in my
blog. http://www.israblog.co.il/35850.
... which includes:
,
, ,
. ,
.
, ,
,
.
,.
As far as I
I'm sad to announce that MD5 is no longer considered secure.
A recent research found how to produce collisions in MD5 (from md5sum) in
a small amount of time (1 hour + 5 minutes).
Why does it bother us?
Well, it is now easy to find two pieces of code A and B, where A is good
code and B is
Hello Orr all,
any proof-of-concept code to try out?
(and sorry for not coming yesterday. I really wanted to hear the
combined lecture, but was under the impression that it's only next week
:((( )
Eli
Orr Dunkelman wrote:
A recent research found how to produce collisions in MD5 (from md5sum)
http://eprint.iacr.org/2004/199
paper.
The code exist The technique is quite blurry in the 4-page paper...
On Tue, 17 Aug 2004, Eli Billauer wrote:
Hello Orr all,
any proof-of-concept code to try out?
(and sorry for not coming yesterday. I really wanted to hear the
combined lecture, but
AFAIK (from a person who heard their technique) it is easy to tweak an
ISO.
C code might be a bit harder, but it looks a bit technical in nature to
solve the problem as well.
On Tue, 17 Aug 2004, Eli
Billauer wrote:
Orr Dunkelman wrote:
http://eprint.iacr.org/2004/199
paper.
The code
On Tue, Aug 17, 2004 at 11:22:27AM +0300, Orr Dunkelman wrote:
I'm sad to announce that MD5 is no longer considered secure.
Eeek. Any inside info on the SHA-1 break rumored?
(http://www.freedom-to-tinker.com/archives/000661.html)
Cheers,
Muli
--
Muli Ben-Yehuda
http://www.mulix.org |
AFAIK, Eli (my advisor) is working for quite some time on this.
I hope he'll succeed.
When this happens - use tiger.
On Tue, 17 Aug 2004, Muli Ben-Yehuda wrote:
On Tue, Aug 17, 2004 at 11:22:27AM +0300, Orr Dunkelman wrote:
I'm sad to announce that MD5 is no longer considered secure.
On Tue, Aug 17, 2004 at 11:57:45AM +0200, Eli Billauer wrote:
(and sorry for not coming yesterday. I really wanted to hear the
combined lecture, but was under the impression that it's only next week
:((( )
We'll be giving the same talk at Telux and at IBM HRL. You're welcome
to come to
Orr Dunkelman wrote:
I'm sad to announce that MD5 is no longer considered secure.
A recent research found how to produce collisions in MD5 (from md5sum) in
a small amount of time (1 hour + 5 minutes).
I read that to say attacker can find two messages, A and B, that have
the same hash. Now, the
I read that to say attacker can find two messages, A and B, that have
the same hash. Now, the questions:
1. Do A and B have to follow some mathematical rule? I.e. - is it
possible to say This particular A cannot be the result of this attack?
Currently yes. but soon not. It's only a technical
14 matches
Mail list logo
