Scribd
Upload
4 views

Euclid's Algorithm Is A Technique For Finding The Greatest Common

Euclid's algorithm is a technique for finding the greatest common divisor (GCD) of two integers or polynomials. It works by repeatedly dividing the larger number/polynomial by the smaller until the remainder is zero, with the last non-zero remainder being the GCD. For polynomials, the algorithm involves dividing one polynomial by another and iterating until the remainder is zero. The GCD of two polynomials a(x) and b(x) can be found by applying this division algorithm repeatedly until the remainder is zero, with the final remainder being the GCD. In a Galois field GF(2m), a primitive element is one whose powers generate all non-zero elements of the field. The minimal polynomial of an element

Uploaded by

israel_zamora6389
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Euclid's Algorithm Is A Technique For Finding The Greatest Common

Euclid's algorithm is a technique for finding the greatest common divisor (GCD) of two integers or polynomials. It works by repeatedly dividing the larger number/polynomial by the smaller until the remainder is zero, with the last non-zero remainder being the GCD. For polynomials, the algorithm involves dividing one polynomial by another and iterating until the remainder is zero. The GCD of two polynomials a(x) and b(x) can be found by applying this division algorithm repeatedly until the remainder is zero, with the final remainder being the GCD. In a Galois field GF(2m), a primitive element is one whose powers generate all non-zero elements of the field. The minimal polynomial of an element

Uploaded by

israel_zamora6389
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

9.

Euclids Algorithm


Euclids algorithm is a technique for finding the greatest common


divisor ( a , b ) of two integers or polynomials a and b .

Proposition

(2.18, page 48)

Let a and b be two positive integers (or polynomials)


Then if
for

a = q1 b + r1
0 r1 < b

( 0 deg ( r1 ) deg ( b ) )

One has ( a , b ) = ( b , r1 )
where ( a , b ) denotes greatest common divisor.

b = q2 r1 + r2
M
rn- 2 = qn rn- 1 + rn
rn- 1 = qn+ 1 rn

( b , r1 ) = ( r1 , r2 )

( a , b ) = rn

Example:
Suppose

a = 186, b = 66 ,

then

186 = 66 2
66 = 54 1
54 = 12 4
12 = 6 2

+ 54
+ 12
+6
+0

the greatest common divisor is 6 .

Euclids Division Algorithm for Polynomials


Given two polynomials a( x ) and b( x )
Their greatest common divisor can be computed by an iterative
application of the division algorithm. If the degree of a( x ) is
greater than the degree of b( x ) , the computation of GCD

( a( x ) , b( x ) ) is

a( x ) = q1 ( x ) b( x ) + r1 ( x )
b( x ) = q2 ( x ) r1 ( x ) + r2 ( x )
r1 ( x ) = q3 ( x ) r2 ( x ) + r3 ( x )
M
rn- 1 ( x ) = qn+ 1 ( x ) rn ( x )
where the iterative process stops when a remainder of zero is
obtained.
Then the greatest common divisor of a( x ) and b( x ) is

rn ( x ) = GCD( a( x ) , b( x ) )

Example:

a( x ) = x 3 + 1
b( x ) = x 2 + 1
GCD of a( x ) and b( x ) is x + 1

x 3 + 1 = ( x 2 + 1) x + ( x + 1)
x 2 + 1 = ( x + 1) x

10. Arithmetic Operations in GF( 2 m )




Primitive Elements
Consider the Galois field GF( 2 m ) generated by the primitive
2
m -1
m
polynomial p( x ) = p0 + p1 x + p2 x + L + pm 1 x + x

Definition:
The element (a root of

p( x ) ) whose powers

generate all the non-zero elements of GF( 2 m ) is called a


primitive element of GF( 2 m ).

In fact, any element in GF( 2 m ) whose powers generate all


the nonzero elements of GF( 2 m ) is a primitive element.

Example:

4 and 7 are also primitive elements of GF( 2 4 ).

Minimum Polynomial
(1) Consider the Galois field GF( 2 m ) generated by a primitive
polynomial p( x ) of degree m. Let

be a non-zero

element of GF( 2 m )
Consider the powers
2

, 2 , 2 , L , 2 , L
If e is the smallest nonnegative integer for which
e

2 =
Then the integer e is called the exponent of .

(2) consider the product,


e1

( x ) = ( x + )( x + 2 )L ( x + 2 )
= a0 + a 1 x + a 2 x 2 + L + a e - 1 x e - 1 + x e
is a polynomial of e degree.
We can see that ( x ) is binary and irreducible over
GF( 2 ). ( x ) is called the minimal polynomial of the
element .

You might also like