Ch4Crypto6e讲课.ppt

* Table 4.5 shows arithmetic operations in GF(7). * Table 4.5 shows arithmetic operations in GF(7). In this section, we have shown how to construct a finite field of order p, where p is prime. GF(p) is defined with the following properties: GF(p) consists of p elements 2. The binary operations + and * are defined over the set. The operations of addition, subtraction, multiplication, and division can be performed without leaving the set. Each element of the set other than 0 has a multiplicative inverse We have shown that the elements of GF(p) are the integers {0, 1, . . . , p – 1} and that the arithmetic operations are addition and multiplication mod p * * Before continuing our discussion of finite fields, we need to introduce the interesting subject of polynomial arithmetic. We are concerned with polynomials in a single variable x , and we can distinguish three classes of polynomial arithmetic. ? Ordinary polynomial arithmetic, using the basic rules of algebra. ? Polynomial arithmetic in which the arithmetic on the coefficients is performed modulo p ; that is, the coefficients are in GF(p ). ? Polynomial arithmetic in which the coefficients are in GF(p ), and the polynomials are defined modulo a polynomial m (x ) whose highest power is some integer n . * Polynomial arithmetic includes the operations of addition, subtraction, and multiplication, defined in the usual way, ie add or subtract corresponding coefficients, or multiply all terms by each other. Examples of Polynomial Arithmetic * * Let us now consider polynomials in which the coefficients are elements of some field F; we refer to this as a polynomial over the field F. In that case, it is easy to show that the set of such polynomials is a ring, referred to as a polynomial ring . That is, if we consider each distinct polynomial to be an element of the set, then that set is a ring. When polynomial arithmetic is performed on polynomials over a field, then division is possible. Note that this do