HP3000-L Archives

October 2001, Week 2

HP3000-L@RAVEN.UTC.EDU
Options: Use Monospaced Font
Show Text Part by Default
Show All Mail Headers

Message: [<< First] [< Prev] [Next >] [Last >>]
Topic: [<< First] [< Prev] [Next >] [Last >>]
Author: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Subject:
Re: Checksum Logic
From:
David T Darnell <[log in to unmask]>
Reply To:
David T Darnell <[log in to unmask]>
Date:
Wed, 10 Oct 2001 13:57:56 -0700
Content-Type:
text/plain
Parts/Attachments:
text/plain (11 lines) 
Pardon my imprecise vocabulary, but:

With most checksumming (bytewise) the bytes could be reordered yielding the same checksum.  Granted we were not talking about checksumming only, but a sugestion to help detect malicious alterations -

checksumming on some n-bit cycle where n is best chosen as a prime number > 3 would make the changes of byte-swapped data producing the same checksum much smaller.

-Dave

* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *

ATOM RSS1 RSS2