1995-10-19 - Re: 50 attacks… [NOISE]

Header Data

From: Laurent Demailly <dl@hplyot.obspm.fr>
To: fc@all.net (Dr. Frederick B. Cohen)
Message Hash: 7b988a6938241dbd11ed249b937d25102b7528b1c2d0ba8366f7b41b59b2117c
Message ID: <9510191823.AA02208@hplyot.obspm.fr>
Reply To: <199510191427.HAA10783@jobe.shell.portal.com>
UTC Datetime: 1995-10-19 18:25:34 UTC
Raw Date: Thu, 19 Oct 95 11:25:34 PDT

Raw message

From: Laurent Demailly <dl@hplyot.obspm.fr>
Date: Thu, 19 Oct 95 11:25:34 PDT
To: fc@all.net (Dr. Frederick B. Cohen)
Subject: Re: 50 attacks... [NOISE]
In-Reply-To: <199510191427.HAA10783@jobe.shell.portal.com>
Message-ID: <9510191823.AA02208@hplyot.obspm.fr>
MIME-Version: 1.0
Content-Type: text/plain


Someone abused "Frederick B. Cohen"'s reputation by making him write :
 > > there is no way to do this in practice because as RSA-based signatures
 > > are actually implemented only hashes are signed.  This is done exactly to
 > > prevent this and similar attacks.
 > And how secure is the hash?
By design choice, "Very secure"...("the difficulty of coming up with
any message having a given message digest is on the order of 2^128
operationssee end") 
 > It it possible to create values that will
 > hash to each prime (or something else that does the job)?
No.
 > Is the hash
 > something we can figure a way to precompute using massively parallel
 > processing so that we can then provide a set of codes which will produce
 > the desired results? (etc.)
No.

Why wouldn't you try to answer the questions yourself before mailing
random thought ?
see RFC1321 The MD5 Message-Digest Algorithm
and numerous reviews...

Maybe I was being just "tested" and should not have replied :/

dl
--
Laurent Demailly * http://hplyot.obspm.fr/~dl/ * Linux|PGP|Gnu|Tcl|...  Freedom
Prime#1: cent cinq mille cent cinq milliards cent cinq mille cent soixante sept

Uzi security Marxist NSA ammunition NORAD FSF





Thread