chap4-数论有线域.pptVIP

乘法逆元 思考 把下图中所有的变量都看成函数， r(x),a(x),b(x)，q(x),x(x),y(x).etc. 计算(x^7+x+1)mod(x^8+x^4+x^3+x+1)的乘法逆元，结果是x^7 作业 11-26收 4.6 4.15(a) 4.19(a) 4.25(b) 4.26 4.27 作业题是 * * Illustrate how we can compute successive instances of GCD(a,b) = GCD(b,a mod b), example taken from text. Note this MUST always terminate since will eventually get a mod b = 0 (ie no remainder left). Answer is then the last non-zero value. In this case GCD(1970,1066)=2. * 计算a和b的最大公约数。 直到r=0为止，其前一个r即为两个数的最大公约数。 * 计算a和b的最大公约数。 直到r=0为止，其前一个r即为两个数的最大公约数。 * Example showing multiplication in GF(7), from Stallings Table 4.3b. * 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. The examples are from the text, with working in Stallings Figure 4.3. * Consider variant where now when computing value of each coefficient do the calculation modulo some value, usually a prime. If the coefficients are computed in a field (eg GF(p)), then division on the polynomials is possible, and we have a polynomial ring. Are most interested in using GF(2) - ie all coefficients are 0 or 1, and any addition/subtraction of coefficients is done mod 2 (ie 2x is the same as 0x!), which is just the common XOR function. * Note that we can write any polynomial in the form of f(x) = q(x) g(x) + r(x), where division of f(x) by g(x) results in a quotient q(x) and remainder r(x). Can then extend the concept of divisors from the integer case, and show that the Euclidean algorithm can be extended to find the greatest common divisor of two polynomials whose coefficients are elements of a field. Define an irreducible (or prime) polynomial as one with no divisors other than itself 1. If compute polynomial arithmetic modulo an irreducible polynomial, this forms a finite field, and the GCD Inverse algorithms can be adapted for it. * Example shows addition multiplication in GF(23) modulo (x3+x+1),