Finite Fields: Delivered by Joel Anandraj.E Ap/It

LECTURE 6
FINITE FIELDS
Delivered by
Joel Anandraj.E
AP/IT
Overview
 A finite field or Galois field is a field that contains a finite

number of elements.
 A finite field is a set on which the operations of

multiplication, addition, subtraction and division are defined
and satisfy certain basic rules.
 Finite Field exist if and only if there are Pm elements, where P is a
prime number and m is an integer.
 For a given prime number the finite field of order p can be

represented as GF(P) and it is defined as set Zp of integers together
with arithmetic operations modulo P.
Example:
 GF(11) is a finite Field.
 GF(81) =GF(3) is a Finite Field.
 GF(256)=GF(28) is a Finite Field
 But there is no Finite Field for 12, i.e., 12=
Types of Finite Field
M=1 M >1
GF(P)
 If M is equal to 1, then it is called Prime Field

 If M value is greater than 1 then it is called Extension Field.
Prime Field:
 The Elements of the prime field are the integers {0…p-1}.

Addition ,Subtraction and Multiplication in GF(P).
 Let a , b  GF(P) ={0,1,…p-1}
 Such that,
 a+ b  c Mod P
a-b  c Mod P
a*b  c Mod P
Inversion in GF(P).
 Any integer in GF(p)or Zn has multiplicative inverse if and
only if that integer is relatively prime to n.
 For each w  Zp ,w 0 , then there exist a z Zp , such that
w * z  1 Mod P.
Polynomial Arithmetic
INTRODUCTION
 A Polynomial is an expression of more than two algebraic terms,
 A Polynomial of degree is an expression of form where ,
n
f(x)=an xn + an-1x +….a1x+a0=  ai xi
n-1
i 0
 ai is the coefficient
 x is the variable.
 A Zero degree polynomial is called constant polynomial.
Eg., 1 or 2 or 3 or x0 . 4
 An nth degree polynomial is called a monic polynomial.
Eg., x3 + 5x2 +2x +1

Polynomial Arithmetic includes operations like,
 Addition
 Subtraction
 Multiplication
 Division
 Addition and Subtraction are performed by adding or
subtracting corresponding coefficients.
n m
 Let f(x) =  ai xi and g(x) = bi xi where n >= m
i 0 i 0
m n
 f(x) +g(x) =  (ai +bi) xi +  ai xi

i 0 i  m 1
Example :
Polynomial addition:
 f(x)= (x5 + 3x3 + 4)
 g(x)= (6x6 + 4x3)
 f(x) +g(x) = 6x6 + x5 + 7x3 + 4

Polynomial subtraction:
 F(x) = (x5 + 3x3 + 4)
 G(x) = (6x6 + 4x3)
 f(x)-g(x)= -6x6 + x5 -x3 + 4

Multiplication
 We can also multiply two polynomials.
 The general rule is that each term in the first polynomial has to
multiply each term in the second polynomial, then sum the
resulted polynomials up.
 The General form for multiplication is given below,
nm
f(x) * g(x) = 
i 0
ci xi
 Where ck=a0bk +a1bk-1+……….+ak-1b1 +akb0

Example :
Polynomial multiplication:
 f(x)= (x5 + 3x3 + 4)
 g(x)=(6x6 + 4x3)
 f(x) * g(x)= 6x11 + 18x9 + 4x8 + 36x6 + 16x3

Polynomial Division
 We can also divide polynomials using long division.
 But in many cases the divisors cannot divide the dividends, which
means you will have remainders.(refer case 2 for example).
 Polynomial Division is possible if the coefficient set is a Field.

Contd….
 If the degree of f(x) is n and the degree of g(x) is m, and

(m>=n) then the degree of the quotient q(x) is (m-n).
 And the degree of the remainder is almost m-1.

Example
Polynomial Divison (case 1: Where the remainder is zero)
 f(x) = (6x11 + 18x9 + 4x8 + 36x6 + 16x3)

 g(x) = (x5 + 3x3 + 4)
 g(x) / g(x) = 6x6 + 4x3

Example
Polynomial Divison (case 2: Where the remainder is a polynomial)
 f(x) = (3x6 + 7x4 + 4x3 + 5)

 g(x) = (x4 + 3x3 + 4)
 g(x) / g(x) = 6x6 + 4x3

 If a polynomial is divisible only by itself and constants, then we
call this polynomial an irreducible polynomial.
 If the coefficients are taken from a field F, then we say it is a

polynomial over F.
 Having polynomials over field GF(p), we can add and multiply

polynomials just like we have always done but the coefficients
need to be reduced modulo p.
Extension Fields
Motivation
 Most of the encryption algorithms involve using arithmetic

operations on integers.
 For convenience and efficiency, mostly it is preferred not to

waste bit patterns.
 Thereby trying to work with integers that fit exactly into a

given number of bits.
Contd…
 For instance if an algorithm works with 8-bits , then the possible range
of values will be between 0 to 255.
 If the values when subjected to modulo 256 then the set of integers used
by the algorithm wont be field, because 256 is not prime.
Contd.,
 So the nearest prime is 251 ,when used will make the set a Field.
 By using 251 as modulus, values from 251 through 255 would not
be used resulting in inefficient use of storage.
• In other words, we want to work with integers in range 0 through

2n-1.
• But this will eventually make the modulo 2n not to work. (Refer
Next slide for the reason )
 In arithmetic modulo 8 multiplication table the nonzero
integers do not appear an equal number of times.
 But in finite field GF(23) the number of occurrence of the
nonzero integers is uniform for multiplication.
 An Algorithm that maps the integers unevenly onto themselves might
be cryptographically weaker than the one provides a uniform
mapping.
 Finite Field of the form GF(23) are attractive for cryptographic

algorithms.
 Polynomial Arithmetic provides a means for constructing the desired

field.
 And we can call such field as Extension Field.

Extension Fields Overview
 Extension Fields are special cases of finite field with order Pn.
 The elements of GF(Pn) ,where m >1, are polynomials .
 For example GF(23) contains 8 unique elements.
 Each element inside GF(23) is a polynomial representing integer
values from 0 to 23 -1.
 If n=3 then the integers 0…7 can be represented by 8
distinct polynomials of degree<=3.
General representation of Modular Polynomial
an-1 xn-1 +an-2 xn-2 + ….a0 =A(x) GF(2n)

 The Polynomial function to generate GF(23) is a2x2 + a1x +a0
 Where ai belongs to GF(2)={0,1}
 The table below show the Polynomial value of GF(23)
Integer Binary Value Polynomial

0 000 0
1 001 1
2 010 x
3 011 x+1
4 100 x2
5 101 X2 + 1
6 110 x2 +x
7 111 X2+x+1
a2x2 + a1x + a0
Operations in Extension Fields
 Addition and Subtraction are both same in Extension Field.

 Similar to polynomial Addition ,Subtraction
 C(x)=A(x) +B(x)
 A(x) = X2 + 1
 B(x) = x2 +x
 Then C(x)=2x2 +x + 1 [note ai belongs to GF(2),so do mod2]
 Therefore C(x) = x+1 GF(23)
Multiplication :
 Just do the regular polynomial multiplication.
 Let A(x) = x2+x+1
 Let B(x) = x2 + 1
 A(x) * B(x) =C`(x) =x4+x3+x+1
 Here C(x)  GF(23).
 So find the irreducible polynomial of GF(23) and use it for
modulo reduction on C(x).
 Irreducible polynomial for a finite Field can be found by
using the expression below,
m
 P(x) =

i 0
Pi xi , Pi  GF(2).
 Irreducible polynomial for GF(23) is x3 +x +1.
 Therefore, x4+x3+x+1 mod x3 +x +1 =C(x) = x2 + x
 C(x) = x2 + x GF(23)
Thank You…

Finite Fields: Delivered by Joel Anandraj.E Ap/It

Uploaded by

Copyright:

Available Formats

Finite Fields: Delivered by Joel Anandraj.E Ap/It

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Finite Fields: Delivered by Joel Anandraj.E Ap/It

Uploaded by

Copyright:

Available Formats

LECTURE 6

 A finite field or Galois field is a field that contains a finite

 A finite field is a set on which the operations of

 For a given prime number the finite field of order p can be

 If M is equal to 1, then it is called Prime Field

 The Elements of the prime field are the integers {0…p-1}.

 A Polynomial is an expression of more than two algebraic terms,

 A Polynomial of degree is an expression of form where ,

 An nth degree polynomial is called a monic polynomial.

Eg., x3 + 5x2 +2x +1

 f(x) +g(x) =  (ai +bi) xi +  ai xi

 f(x) +g(x) = 6x6 + x5 + 7x3 + 4

 f(x)-g(x)= -6x6 + x5 -x3 + 4

 We can also multiply two polynomials.

 Where ck=a0bk +a1bk-1+……….+ak-1b1 +akb0

 f(x) * g(x)= 6x11 + 18x9 + 4x8 + 36x6 + 16x3

 We can also divide polynomials using long division.

 Polynomial Division is possible if the coefficient set is a Field.

 If the degree of f(x) is n and the degree of g(x) is m, and

 And the degree of the remainder is almost m-1.

 f(x) = (6x11 + 18x9 + 4x8 + 36x6 + 16x3)

 g(x) / g(x) = 6x6 + 4x3

 f(x) = (3x6 + 7x4 + 4x3 + 5)

 g(x) / g(x) = 6x6 + 4x3

 If the coefficients are taken from a field F, then we say it is a

 Having polynomials over field GF(p), we can add and multiply

 Most of the encryption algorithms involve using arithmetic

 For convenience and efficiency, mostly it is preferred not to

 Thereby trying to work with integers that fit exactly into a

• In other words, we want to work with integers in range 0 through

 Finite Field of the form GF(23) are attractive for cryptographic

 Polynomial Arithmetic provides a means for constructing the desired

 And we can call such field as Extension Field.

an-1 xn-1 +an-2 xn-2 + ….a0 =A(x) GF(2n)

Integer Binary Value Polynomial

 Addition and Subtraction are both same in Extension Field.

 Irreducible polynomial for GF(23) is x3 +x +1.

 Therefore, x4+x3+x+1 mod x3 +x +1 =C(x) = x2 + x

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.