On Wed, 12 Dec 2001, Adrian Ettlinger wrote:
> Oh, yes, relative to the MD5 question. When you say MD5 is slow, are you
> referring just to the processing time of computing the hash value? Or is
> there something else inherent to it that makes it slow? Is part of its
> definition the nature of the secondary search? Or is the problem that it
> results in a time-consuming secondary search? BTW, thanks for your further
> tutorial on hash theory and practice.
>
I believe MD5 was shown to be a perfect hash for arbitrarily-length data
by Dr. Ron Rivest who invented it. Otherwise, it would not have been so
commonly used for cryptographical applications. However, it takes quite a
lot of time to compute.
Regards,
Shlomi Fish
> Best regards, -----------------Adrian
>
>
>
>
>
> To unsubscribe from this group, send an email to:
> fc-solve-discuss-unsubscribe_at_yahoogroups.com
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>
--
----------------------------------------------------------------------
Shlomi Fish shlomif_at_vipe.technion.ac.il
Home Page: http://t2.technion.ac.il/~shlomif/
Home E-mail: shlomif_at_techie.com
He who re-invents the wheel, understands much better how a wheel works.
Received on Wed Dec 12 2001 - 05:15:10 IST