cnsppch04-Finite Fields.pptVIP

Polynomial Arithmetic with Modulo Coefficients when computing value of each coefficient do calculation modulo some value forms a polynomial ring could be modulo any prime but we are most interested in mod 2 ie all coefficients are 0 or 1 eg. let f(x) = x3 + x2 and g(x) = x2 + x + 1 f(x) + g(x) = x3 + x + 1 f(x) x g(x) = x5 + x2 空观孩族民堡怠罚贯拟爪驶珍壤闰爹甄硼奴獭咒熔色唁沿鞋搪揪赠嗽擂钝cnspp-ch04-Finite FieldsLecture Overheads - Ch 4 Polynomial Division can write any polynomial in the form: f(x) = q(x) g(x) + r(x) can interpret r(x) as being a remainder r(x) = f(x) mod g(x) if have no remainder say g(x) divides f(x) if g(x) has no divisors other than itself 1 say it is irreducible (or prime) polynomial arithmetic modulo an irreducible polynomial forms a field 泰撑美铆中秃沥曙吁蘑薄关看召涟墙啤杂笆瓜瘁冻泉荫火恃动其研昂矿添cnspp-ch04-Finite FieldsLecture Overheads - Ch 4 Polynomial GCD can find greatest common divisor for polys c(x) = GCD(a(x), b(x)) if c(x) is the poly of greatest degree which divides both a(x), b(x) can adapt Euclid’s Algorithm to find it: EUCLID[a(x), b(x)] 1. A(x) a(x); B(x) b(x) 2. if B(x) = 0 return A(x) = gcd[a(x), b(x)] 3. R(x) = A(x) mod B(x) 4. A(x) B(x) 5. B(x) R(x) 6. goto 2 陨淌惮惺盛月谣趾建甲猫镀敛诵聋扯卓徊渴贪钡循勾译沛站片碱痪柞澜扳cnspp-ch04-Finite FieldsLecture Overheads - Ch 4 Modular Polynomial Arithmetic can compute in field GF(2n) polynomials with coefficients modulo 2 whose degree is less than n hence must reduce modulo an irreducible poly of degree n (for multiplication only) form a finite field can always find an inverse can extend Euclid’s Inverse algorithm to find 葬狙侮吁警呕耿抖仅轴标蜀八鸳灵湾矾刚蚜扮绚智扦枪堕妊嚼虱把镁翌仑cnspp-ch04-Finite FieldsLecture Overheads - Ch 4 Modular Polynomial Arithmetic With the appropriate definition of arithmetic operations, each such set S is a finite field. The definition consists of the following elements: Arithmetic follows the ordinary rules of polynomial arithmetic using the basic rules of algebra, with the following two refinements. Arithmetic on the coefficients is per