Appendix B presents a list of GF(2 ^m) tables generated by a binary primitive polynomial p( x) = x ^m + p _{m ?1} x ^{m ?1} + p _{m ?2} x ^{m ?2} + ... + p ₁ x + p ₀ of degree m, where p _j = 0 and 1, 0 ? j ? m ? 1, and 2 ? m ? 6. Each element in GF(2 ^m) is expressed as a power of some primitive element ? and as a linear combination of ? ⁰, ? ¹, ..., ? ^{m ?1}. The polynomial representation of the element ? ⁱ, i = 0, 1, ..., 2 ^m ? 2 is expressed as ? ⁱ = a _{m ?1} ? ^{m ?1} + a _{m ?2} ? ^{m ?2} + ... + a ₀ with binary coefficients and the coefficients of the polynomial representation of ? ⁱ is expressed as a binary m-tuple [ a ₀ a ₁ ... a _{m ?1}].