-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
On Tuesday 28 June 2005 15:53, Michael Tuexen wrote:
I think, the Internet checksum algorithm (may be with keeping the
full 32 bits
instead of truncating to 16 bits) should already be sufficient for
the audit
purpose. Using this checksum algorithm, we also get order-
invariancy and do
not need to force a specific ordering of the handlespace within a
management
component. It is furthermore very simple and fast (only + and ~
operations
are needed, no *, / or %).
So the Internet checksum is the way to go... I have no particular
preference
in 16 bit or 32 bit.
I would prefer 32 bits. The checksum parameter pads the sum to 32
bits of
space anyway - so why not use the full 32 bits, making the
probability that
two states of the handlespace map to the same checksum value much
smaller?
Best regards
- --
=======================================================================
Dipl.-Inform. Thomas Dreibholz
University of Essen, Room ES210
Inst. for Experimental Mathematics Ellernstraße 29
Computer Networking Technology Group D-45326 Essen/Germany
-
-----------------------------------------------------------------------
E-Mail: dreibh at exp-math.uni-essen.de
Homepage: http://www.exp-math.uni-essen.de/~dreibh
=======================================================================
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.4 (GNU/Linux)
iD8DBQFCwVfb32BbsHYPLWURAs2+AJ4y4dQidaFk8BluPiOCvfbSQG6WiACgpT9t
F391kp60lLQnAatchlEmwgo=
=3/5a
-----END PGP SIGNATURE-----