Errata File (March 2002)
Cryptography and Network Security: Principles and Practice, Second Edition
                               William Stallings
                      (Prentice-Hall, ISBN 0-13-869017-0)

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

-------------------------------------------------------------------------
//////////////////////////////////MARCH LIST/////////////////////////////
-------------------------------------------------------------------------
PAGE    CORRECTION

345 t6: secret -> private

-------------------------------------------------------------------------
//////////////////////////////// FEBRUARY LIST///////////////////////////
-------------------------------------------------------------------------

 29 t20: (a = 0, b = 1, etc.)

36-37: Hill defined inconsistently; key matrix should always be in the same 
       position (before or after the plaintext)

 42 key used in two places: 4312567 -> 3421567

 56 t9: p1,1, p1,1 -> p1,0, p1,1

 63 b7: it should be   RE_i || LE_i , or  RD_(16-i) || LD_(16-i)

 72 t19: f -> F
    T3.4a: The numbering of key bits is based on the original 64-bit key
           which only 56 bits are ultimately used. Bits 8, 16, 24, 32,
           40, 48, 56, and 64 are not used.

 73 b1: Third group of plaintext should be 00101111

 74 t2,3: Last group on both lines should be 1101110

 77 t16: m'(i+1) -> m'(i-1)

 78 F3.10: upper right 000 -> 00
           output of final f function should be 40 08 00 00

 82 t1: 8 bits in row -> 32 bits in row

 90 t1: 0, 1, 2,..., ((2^n) - 1)
    t2: 0 <= m < 2^n

 91 b4: replace 0 <= w <= 2^(n-1) with 0 <= w <= 2^n - 1

 98 b12: (N+1)/(n-1) -> (N+1)/(n+1)

105 Z7 = Z[97..112]    Z37  =  Z[37..52]

109 b8: entire encryption process -> entire decryption process

116 t8: rounded up to x -> rounded up to x+1

124 b19: RC5 -> RC2
    b12: L[T] -> L[T-1]

125 t2: addition is mod 2^16; there is no subtraction
    "j = j + 2" and "j = j + 3" should both be "j = j + 1"
    b18: [j] -> K[j]
    change (( to ( everywhere on page

136 T5.1: hostintermediate -> host-intermediate
          nodeintermediate -> node-intermediate

150 b13: by every integer -> by every odd integer

152 t10: {1, 5, 25,... -> {5, 25, ...

158 F5.15: Upper line between A and B should point from A to B
           Lower line between A and B should point from B to A
    b6: 5.14 -> 3.14

159 b22: Each node of the network -> Each node N of the network
    Step 1: EKn[R] -> Eka[R]

173 t20: block size is 2^k -> block size is k

174 4t: Equation 7.7 -> Equation 7.8

175 F6.5, Decryption: reverse plaintext and ciphertext labels
    Condition 5 should be de mod 96 = 1

177 2nd equation: The entire last product should be mod n

182 step 2: C^(re) -> C(r^e)

191 t2: q, a -> q, alpha

197 b4: (161, 169) -> (161, 69)

204 b12:i ;= 0 -> i := 0

205 t6: k^2 + 2k + 2 -> k^2 + 2k + 1
    T6.6: 28 -> 39

210 t3: should be: p1 < p2 < ... < pt

215 Distributive law: [w * (x + y)]mod n = [(w * x)] + (w * y)]mod n

218 b2: two prime numbers -> two distinct prime numbers

220 3rd equation: plus sign should be multiply sign

221 Derivation just before Section 7.4 is incorrect, but the final
    equation is correct

224 t2: X <- d; Y <- f
    last two lines of example: 6 = 1 * 4 + 2 and 4 = 2 * 2 + 0

225 t9: X3 divided by Y3 -> X3 divided by Y3, multiplied by Y3

227 (7.12): K -> k

234 t1: Pr[gcd(a,b =d] -> Pr[gcd(a,b)=d]
    t2: gcd(a/b, ...   -> gcd(a/d, ...

235 7.11, STEP 1: Set C1 = 1

255 b8: XOR or -> XOR of

257 t8: two time: MAC -> hash code

261 t22: hash of MAC -> hash or MAC

262 b5: b < n -> n < b

262 t4: L - 1 -> L

267 b1: left paren between minus sign and k

286 b3: original message -> original message mod 2^64

292 T9.6: RIPEMD-160 max msg size = °

295 t3: opad = 01011100

297 t13: , by -> , on messages generated by

305 b2 and b4: C -> X

314 t5: k (mod p) -> k (mod q)

315 Prob 10.7: such an increment -> such as increment
               bottom line of table: change A->B to B->A

316 b1: p-1 -> q-1

317 t1: p-1 -> q-1

328 b2: If the uses  -> If the user

330 Table 11.1: steps 5 and 6 should be C to V and V to C repectively

332 message (4): K_c,tgs -> K_c,v
    1st authenticator: TS_2 -> TS_3

335 msg (6): TGS - TGSrem; TS_b -> TS_6

337 T11.3c, messages 5 and 6: Replace TGS with V

341 b7: Initiator Unique Identifier -> Issuer Unique Identifier

343 t7: secret key -> private key
    t12: CA can recover -> CA can verify

346 F11.5.c, msg 2: second rB -> rA

347 t10: A's public key -> A's private key

350 b1: A(0, rA', B) -> A(0,rA', C)

353 indented text: Cn -> C_n (means C sub n)
    second piece of indented text: D_k[C_n} -> D_k[C_n]

365 F12.3, Notation: user b's private key -> user b's public key 
                     user a's public key -> user a's private key

368 F12.5: KRb -> Kub

369 F12.6: Public Key KRb -> Public Key KUa

383 T12.6, bottom right: reverse MUST and SHOULD in last sentence

386 t4: envelopedData -> signedData

395 b6: X12.17 -> X9.17

397 t14: G12 -> G9

398 b7: step G12.a -> step G9.a

421 item c: AH SA inside an ESP SA -> ESP SA inside an AH SA

422 b11: change first C to B

429 1st bullet: KCS -> PKCS

434 F13.13: End System X on left

443 T14.1, Threats&Integrity: no bullet before memory
    T14.1, row 4, column 2: bogus threats -> bogus requests

453 b3: public key -> private key

454 t6: public key -> private key

457 b4: delete final right parenthesis

470 F14.11: D = Decryption (RSA)

489 b4: R = 9.15 -> R = 9.6

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