REPOST: Re: Q: How to test new hash algorithm?



Martin Hvidberg wrote:
Kristian Gjøsteen wrote:
What properties do you want from your hash function that standard
cryptographic hash functions do not provide?

None other that I need it to be running in a programming language called Avenue, this means I have to write one myself since none are included. I just need to check if two larger strings are identical, without actually sending the long stings off to the other end.
It should not be anything fancy, and quick to impliment.

If you don't need cryptographic strength, that is, no one is manipulating the strings to produce a hash collision, I recommend FNV hash as requiring the least code to implement.


--Mike Amling

========= WAS CANCELLED BY =======:
Path: ...news.glorb.com!hwmnpeer01.lga!hwmedia!news.highwinds-media.com!peer01.cox.net!cox.net!p01!fed1read05.POSTED!53ab2750!not-for-mail
From: Mike Amling <nospam@xxxxxxxxxx>
Control: cancel <wRQCf.1539$Ql1.1504@xxxxxxxxxxxxxxxxx>
Subject: Cancel "Re: Q: How to test new hash algorithm?"
Newsgroups: sci.crypt
Message-ID: <xILBb.3106$Or4.6783@xxxxxxxxxxxxxxxxx>
MIME-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 8bit
User-Agent: Microsoft Outlook Express Macintosh Edition - 8.0 (6387)
Lines: 2
Date: Sun, 29 Jan 2006 17:59:12 GMT
NNTP-Posting-Host: 70.162.170.136
X-Complaints-To: abuse@xxxxxxx
X-Trace: fed1read05 1138562983 70.162.170.136 (Sun, 29 Jan 2006 14:29:43 EST)
NNTP-Posting-Date: Sun, 29 Jan 2006 14:29:43 EST
Organization: Cox Communications
.