Errata File (February 2007)
Cryptography and Network Security: Principles and Practice, Fourth Edition
                               William Stallings
                      (Prentice-Hall, ISBN 0-13-187316-4)

------------------------------SYMBOLS USED-------------------------------
| ti = ith line from top;  bi = ith line from bottom; Fi = Figure i
| X -> Y = replace X with Y; Ti = Table i; Pi = Problem i
-------------------------------------------------------------------------

-------------------------------------------------------------------------
////////////////////////////////FEBRUARY LIST////////////////////////////
-------------------------------------------------------------------------
PAGE    CORRECTION

 ix The Table of Contents should refer to the online appendices C thru H

-------------------------------------------------------------------------
////////////////////////////////JANUARY LIST/////////////////////////////
-------------------------------------------------------------------------

 11 F1.2: right-hand axis should indicate low at bottom and high at top

 57 P2.4: 2nd line of ciphertext should be:
          (88)5* ;46(;88*96*?;8)*à(;485);5* 2:*à(;4956*2(5*-4)8¦8*
          3rd line of ciphertext should be:
          ;4069285);)6 8)4àà;1(à9;48081;8:8à1;48 85;4)485 528806*81

71-76: The multiply symbol is used instead of the XOR symbol on pages 71,
       72, 76

 80 T3.4a: rightmost column should be unshaded

 83 b5 complexity -> encryptions

 92 P3.8: hex-C is shown as 0100 but should be 1100
    P3.8c: Figure 3.8 -> Figure 3.5

92-93: A circled multiply symbol is used instead of the XOR symbol on
      pages 92, 93

 93 P3.13a: Hint: show that (A XOR B)' = A' XOR B
    P3.15: the equation's last term should be EL(k,m2)

 94 P3.20: 3.15 -> 3.18

105 T4.2: delete second distributed law

112 b2: {0,1,...,p} -> {0,1,...,p-1}

115 b8: m ³ n should be n ³ m
    b7: m - n should be n - m

122 b7: instead of notation indicating set inclusion, it should indicate
        that a(x) is congruent to (x + 1) modulo m(x)
    AES example: delete x^7 immediately under the long division line

123 Extended Euclid 5: A3(x)-QB3(x)] -> A3(x)-Q(x)B3(x)]

126 b3: The two X on the right side should be XOR

144 F5.3: AddRoundKey: 2nd ro should be r6

154 b10: change wavy equal sign to XOR

177 b5: D(K2, P) -> D(K2, C)

187 The definition of OFB has been updated in SP 800-38A so that now
    the entire output block is fed into the next stage, not just s bits

193 F6.9: upper right-hand corner should read 253 254 255

213 F7.9, step 2: E(Ka,[Ks || IDA || IDB || N1) || E(Kb, [Ks || IDA])

217 F7.11: Second message: Mkm -> Km

229: A -> IDA     B -> IDB

230 P7.5: k must be relatively prime with m-1

237: 1st row, 10th column, 0 -> 907

270 t5: 161 = 10 x 160 + 1 -> 161 = 1 x 160 + 1

286 t11: prime, than -> prime, then
    b11: Therefore, p divides -> Therefore, n divides

294 t12: Anyone needed this user's -> Anyone needing this user's

237 11th row, last column, 1999 -> 1993

301 steps 5 and 6: XA -> YB

311 F10.12: User B Key Generation: nB < n instead of nA < n

313 T10.3: 1st column, 5th line, 92 -> 192

354 b1: c = -> d =

363 b2: 10 round keys -> 11 round keys

379 t19: it must to authenticate -> it must authenticate

387 step 6: Nb is encrypted by PUa but not by PRauth

394 P13.5: Problem 13.1 -> Problem 13.4

406 t4: delete "and password"
    t7: password. -> password (Kc), which is already stored at the AS.
    b10: incoming ticket -> incoming ticket, using a key shared only by
         the AS and the TGS (Ktgs),
    b13, b10: should be points 3 and 4, not 1 and 2

421 F14.4: Encrypted -> Encrypted hash

554 t3, equation: PIMS -> PIMD

608 t2: 1998 -> 1988
    item 1.(c): system directory -> system dictionary

646 P20.5: Drake -> Alice

 ------------------------------------------------------------------------
|         A current version of this file, named Errata-Crypto4e-mmyy,
|                 is available at WilliamStallings.com
 ------------------------------------------------------------------------