RE: [MiNT] Hash filename for index

["Julian Reschke" <reschke@muenster.de>]

It certainly is *much* slower than a plain 32 Bit CRC (POSIX cksum).

BTW: when I wrote the code that is in TOSFS, I checked ir against all my
partitions and found no duplicates.

> -----Original Message-----
> From: owner-mint@fishpool.com [mailto:owner-mint@fishpool.com]On Behalf
> Of Thomas Binder
> Sent: Friday, June 23, 2000 1:17 AM
> To: MiNT mailing list
> Subject: Re: [MiNT] Hash filename for index
>
>
> Hi!
>
> On Thu, Jun 08, 2000 at 12:42:17AM +0200, Guido Flohr wrote:
> > Comments? Which hash algorithm would be a good choice?
>
> As both MD5 and SHA-1 are already part of the kernel source, one of them
> could be used to calculate the hash, taking the first 32 bits of the 128
> (160 for SHA-1) bits of the hash for the index.
>
> I don´t know though, how fast these two algorithms actually are, but as
> SHA-1 is used frequently for /dev/random to add random data to the
> entropy pool, it can´t be that slow.
>
>
> Ciao
>
> Thomas
>
>
> --
> Thomas Binder (Gryf @ IRCNet)  gryf@hrzpub.tu-darmstadt.de
> PGP-key available on request!  binder@rbg.informatik.tu-darmstadt.de
> Vote against SPAM:             http://www.politik-digital.de/spam/
>