RE: iSCSI: 12-97 Bit Rule

[Bill Studenmund <wrstuden@wasabisystems.com>]

On Thu, 13 Jun 2002, THALER,PAT (A-Roseville,ex1) wrote:

> Bill,
>
> One could say:
> - Computing the CRC over any segment (data or header) extended to include
> the CRC built using the generator 0x11edc6f41 will get always the value
> 0x1c2d19ed as the result before complementing. This value is given here in its polynomial form - i.e. not mapped as the digest word.
>
> or
> - Computing the CRC over any segment (data or header) extended to include
> the CRC built using the generator 0x11edc6f41 will get always the value
> 0xe3d23612 as its final CRC. This value is given here in its polynomial
> form - i.e. not mapped as the digest word.
>
> or
> - Performing the formation of the plynomial M(x) over any segment (data or header) extended to include the digest, complementing the most significant 32 bits, multiplying by x^32 then dividing by G(x) will always produce the remainder polynomial 0x1c2d19ed. This value is in its polynomial form - not complemented and not mapped into the digest word.
>
> or
> - Computing the CRC over any segment (data or header) extended to include
> the CRC built using the generator 0x11edc6f41 will get always produce
> R(x) = 0x1c2d19ed. This value is in its polynomial form - not complemented and not mapped into the digest word.
>
> I like the last one best because it uses the term that relates the result to where it will appear in the process above.

Sounds good. That's what we used to have, but with R(x) now specific.

Take care,

Bill