大连理工大学网络安全与密码学chap有线域.pptVIP

思考： 计算3*7，和129*5 在该域内的数值？ * 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. * 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 t