Newsgroups: comp.compilers,comp.theory,comp.lang.misc,comp.lang.dylan
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!oitnews.harvard.edu!purdue!ames!hookup!usenet.eel.ufl.edu!news.mathworks.com!news.kei.com!world!iecc!compilers-sender
From: mw@ipx2.rz.uni-mannheim.de (Marc Wachowitz)
Subject: Re: Looking for high-quality hashing function for dynamic linker
Message-ID: <95-08-049@comp.compilers>
Followup-To: comp.compilers
Keywords: theory
Sender: compilers-sender@chico.iecc.com
Organization: Compilers Central
References: <95-08-021@comp.compilers>
Date: Wed, 2 Aug 1995 21:33:52 GMT
Approved: compilers@chico.iecc.com
Lines: 13
Xref: glinda.oz.cs.cmu.edu comp.compilers:9219 comp.theory:13269 comp.lang.misc:22521 comp.lang.dylan:4986

Eric Benson (eb@kaleida.com) wrote:
[...]
> Is it feasible to compute a signature consisting of a few (say, less than
> ten) 32 bit words and use this for comparison instead of the entire set of
> names?

The MD5 algorithm should do what you want; it computes a 128-bit signature.
Look at ftp://rsa.com/pub/rfc1321.txt for a description and C source code.

                Marc Wachowitz <mw@ipx2.rz.uni-mannheim.de>
-- 
Send compilers articles to compilers@iecc.com,
meta-mail to compilers-request@iecc.com.
