补充有限域理论基础知识.pdfVIP

Cryptography and Network Security Chapter 4 Fourth Edition by William Stallings Lecture slides by Lawrie Brown 计算机科学中的有限域理论 – Finite Fields Introduction  will now introduce finite fields （有限域）  of increasing importance in cryptography  AES, Elliptic Curve, IDEA, Public Key  concern operations on “numbers”  where what constitutes a “number” and the type of operations varies considerably  start with concepts of groups （群）, rings （环）, fields （域）from abstract algebra （抽象代数） Group （群）  a set of elements （元素）or “numbers”  with some operation （运算）whose result is also in the set (closure) （封闭性）  obeys:  associative law: (a.b).c = a.(b.c) （结 合律）  has identity e: e.a = a.e = a （单位元） -1 -1  has inverses a : a.a = e （逆元）  if commutative a.b = b.a （交换律） then forms an abelian group （阿贝尔群） Cyclic Group （循环群）  define exponentiation as repeated application of operator 3  example: a = a.a.a  and let identity be: e=a0  a group is cyclic if every element is a power of some fixed element  ie b = ak for some a and every b in group  a is said to be a generator of the group （群的生成元） Ring （环）  a set of “numbers”  with two operations (addition and multiplication) which form:  an abelian group with addition operation  and multiplication:  has closure  is associative  distributive over addition: a(b+c) = ab + ac  if multiplication operation is commutative, it forms a commutative ring （交换环）  if multiplication operation has an identity and no