The MARS document: Errata
This page contains a list of errors in the
version of the MARS document on NIST's CD-ROM.
Errata in the revised document (from August 20, 1999):
There are errors in the desciption of the key-setup procedure.
-
The formula for the linear transformation in item 2(a) on Page 20, as well
as in line 12 of the pseudo-code on Page 21, should be
T[i]= T[i] xor ((T[i-7 mod 15] xor T[i-2 mod 15])<<<3) xor
(4i+j)
-
Line 10 of the pseudo-code on Page 21, should be
Errata in the original document:
-
Subsubsection 2.5.1 (Decryption) should be Subsection 2.6.
-
In the description of the S-box design (Subsection 2.6, Page 18), the formula
for generating the pseudorandom S-boxes should be S[5i+j] = SHA1(5i
| c1 | c2 | c3)
-
The description in Step 4(b) of the key expansion procedure (Subsection
2.7, Page 21) is not clear enough. The text should read:
"[...] Then we reset to 0 the 1's in M which correspond to the "end-points
of runs of 0's or 1's in w", and also the two low order bits. More precisely,
the i'th bit of M is reset to 0 if i < 2, or if the i'th bit of w differs
from either the (i+1)'th or the (i-1)'th bits. For the top-most bit, i=31,
we assume that the (i+1)'th bit of w is 0."
-
Similarly, at the end of Line 26 in the key expansion pseudo code (Page
22), it should say
"(for l = 31, assume w(l+1) = 0)"
-
The caption under Figure 12 (Page 48) should say "Third attempt to devise
a characteristic of the keyed transformation."
-
The description of the Carter-Wegman MAC at the end of Subsection 5.2 (Page
58) is missing a reference to the paper. The reference is
M. Wegman. and L. Carter. New hash functions and their use in authentication
and set equality. J. of Computer and System Sciences, vol. 22, 1981,
pp. 265-279.
[Research home page | IBM home page ]