Path: utzoo!attcan!uunet!lll-winken!lll-tis!ames!necntc!ima!cfisun!lakart!dg
From: dg@lakart.UUCP (David Goodenough)
Newsgroups: comp.protocols.misc
Subject: 12 bit checksum and CRC for KERMIT
Keywords: Checksums CRC Kermit
Message-ID: <240@lakart.UUCP>
Date: 7 Sep 88 21:54:22 GMT
Reply-To: dg@lakart.UUCP (David Goodenough)
Followup-To: poster
Organization: Lake - The systems people
Lines: 17

I was reading back over an early issue of BYTE that talked about the
KERMIT protocol, and it mentioned that KERMIT can use a larger checksum
(12 or 14 bits I think), as well as a CRC for error checking. Does
anyone have any information on exactly how this is done: i.e. once I
have my big checksum, how do I send it, and how do I send the CRC, and
what polynomial is used. I gather that selection of CRC / checksum is
determined by a byte in the parameter packet exchange: and both ends have
to agree or normal 6 bit checksumming is used. Details of this would also
be welcome.

E-mail responses, as I don't usually read this newsgroup.

		Thanks in advance,
-- 
	dg@lakart.UUCP - David Goodenough		+---+
							| +-+-+
	....... !harvard!cca!lakart!dg			+-+-+ |
						  	  +---+