Path: utzoo!mnetor!uunet!husc6!hao!oddjob!gargoyle!ihnp4!cbosgd!osu-cis!tut!lvc
From: lvc@tut.cis.ohio-state.edu (Lawrence V. Cipriani)
Newsgroups: comp.unix.questions
Subject: Re: Sum history
Message-ID: <6275@tut.cis.ohio-state.edu>
Date: 9 Feb 88 14:07:41 GMT
References: <1451@quacky.mips.COM> <7222@brl-smoke.ARPA>
Organization: The Ohio State University Dept of CIS
Lines: 18

In article <7222@brl-smoke.ARPA> gwyn@brl.arpa
	(Doug Gwyn (VLD/VMB) <gwyn>) writes:

>Yes, use that flavor for checksum purposes.
	(Doug was speaking of sum -r here)

Though this is much better than just summing up the bytes, it
hardly qualifies as a good checksum.  It is easy to find different
sequences of numbers that generate the same "sum -r" (if you know
the algorithm).  It is not a crc if that is what you are looking for.
There were some crc codes floating around on Usenet once, but
I don't have them now.

-- 
oo
Larry Cipriani, AT&T Networks Systems (by day) Ohio State University (by night)
Domain: lvc@tut.cis.ohio-state.edu
Path: ...!cbosgd!osu-cis!tut.cis.ohio-state.edu!lvc (yes its right)