ECT-434

SECURE COMMUNICATION

Module 2: Finite Fields

1.Groups,Rings and Fields E

G
2.Modular arithmetic LL
E
O
3.Euclidean algorithm G
G
C

EN
4. Finite Fields of the Eform
A GF(p)
5.Polynomial arithmetic
, KM
E
C
,P E
.,A
R
A.
ara
ush
B

Bushara A R
AP, ECE
KMEA ENGG.COLLEGE
 E
EG
LL
O
1. Groups,Rings and Fields C
G
G
EN
A
➢ Groups, rings, and fields are M
E the fundamental elements
K
of a branch of mathematics E, known as abstract
EC
algebra, or modern algebra.
P,
.,A
R
A.
Groups ra
a
sh
A group G, sometimes
Bu ·
denoted by {G, } is a set of elements

with a binary operation, denoted by · ,that associates to

each ordered pair (a, b) of elements in G an element (a · b)

in G, such that the following axioms are obeyed:

(A1) Closure: If a and b belong to G, then a · b is also in G.

(A2) Associative: a · (b · c) = (a · b) · c for all a, b, c in G.
(A3) Identity element: There is an element e in G such that
a · e = e · a = a for all a in G.
(A4) Inverse element: For each a in G there is an element
a' in G such that a · a' = a' · a = e.

A group is said to be abelian if it satisfies the following

additional condition:
(A5) Commutative: a · b = b · a for all a, b in G.
E
EG
LL
O
Rings C
G
G
A ring R, sometimes denoted byEN {R, +, x}, is a set of
EA
elements with two binary operations, called addition and
KM
multiplication, such that forE, all a, b, c in R the following
C
axioms are obeyed: ,P E
.,A
R
A.
(A1-A5) R is an abelianra group with respect to addition; that
a
sh A1 through A5.
is, R satisfies axioms
u
B
(M1) Closure under multiplication: If a and b belong to R,
then ab is also in R.
(M2) Associativity of multiplication: a(bc) = (ab)c for all a,
b, c in R.
(M3) Distributive laws: a(b + c) = ab + ac for all a, b, c in R.
(a + b)c = ac + bc for all a, b, c in R.

A ring is said to be commutative if it satisfies the following

additional condition:
(M4) Commutativity of multiplication: ab = ba for all a, b
in R.

A ring is said to be integral domain, which is a

commutative ring that obeys the following axioms:
(M5) Multiplicative identity: There is an element 1 in R such
that a1 = 1a = a for all a in R.
(M6) No zero divisors: If a, b in R and ab = 0, then either a
= 0 or b = 0. E
G E
LL
O
Fields C
G
G
A field F, sometimes denoted by {F,E+, N x}, is a set of elements
with two binary operations, EA called addition and
, KM
multiplication, such that forE all a, b, c in F the following
C
axioms are obeyed: ,P E
.,A
(A1-M6) F is an integral R domain; that is, F satisfies axioms
A.
A1 through A5 andra M1 through M6.
a
(M7) Multiplicative
ush inverse: For each a in F, except 0, there
B
is an element a-1 in F such that aa-1 = (a-1)a = 1.

Examples of Field:
● Rational Numbers
● Real Numbers
● Complex Numbers

Set of Integers not a field…

 E
EG
LL
O
C
G
G
EN
2. ModularMEarithmetic
A
K
E,
–Given any positive integer C n and any integer m,
,P E
if we divide m by n, Rwe .,
A get an integer quotient, q,
A.
and integer remainder,
ra r, that obey the following
ha
relationship: Bm=5,n=3
us r=2 q=1 5mod3=2

–
–The remainder, r, is often referred to as a
residue of modulo n, and is the smallest
non-negative integer that differs from m by a
multiple of n.
For example,
0,1…..6

5 mod 3
-5 mod 3
5 mod -3
E
G
-5 mod -3 E
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
•Two integers, a and b are said to be
congruent (denoted by ) if:
amod m=b
that is, "a is congruent to b modulo m"
•Alternatively, in arithmetic modulo m, a
and b are equivalent if their difference, (a -
b), is a multiple of m; that is, m | (EaGE - b)
LL
O
C
G
G
EN
EA
•The set of integers Z , KM= {0,1, ... m - 1} form
m E
C
the complete set of P, residues modulo m --
E
, A
R.
there are only m different
A. integers, mod m
ra
a
•The operation ush a mod m denotes the residue
B
of a, such that the residue is some integer
from 0 to m - 1. This operation is known as a
modular reduction.
Example:
10 mod 4 = 2
•Properties of modular arithmetic is:
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B

5 mod 6 = 5
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
•Recall that exponentiation is defined:

Exponentiation is performed by repeated

multiplication, as in ordinary arithmetic.
E
EG
11 mod 13 =11 LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 3.Euclidean algorithm

❖ One of the basic techniques of number

theory is the Euclidean algorithm, which is
a simple procedure for determining the
greatest common divisor of two positive
integers. E
LEG
L
O
C
Greatest Common Divisor G
G
EN
EA
KM
gcd(a, b) - greatest common C
E, divisor of a and b.
,E
The positive integer .,A
P c is said to be the
.R
greatest common ra
A divisor of a and b if
ha
1.c is a divisor
Bu
s of a and of b;
2.any divisor of a and b is a divisor of c.

gcd(a, b) = gcd(-a, b) = gcd(a, -b) =

gcd(-a, -b).
In general, gcd(a, b) = gcd(|a|, |b|).
 gcd(60, 24) = gcd(-60, 24) = 12

Finding the Greatest Common Divisor

❖ The Euclidean algorithm is based on the
following theorem:
❖ For any nonnegative integer a and any
positive integer b, E
LEG
L
O
C
gcd(a,b) = gcd(b,Ga G mod b)
EN
gcd(55, 22) = gcd(22, 55 mod
EA 22) = gcd(22, 11) = 11
, KM
E
EC
gcd(18, 12) = gcd(12,
., AP, 6) = gcd(6, 0) = 6
.R
gcd(11, 10)ra = gcd(10, 1) = gcd(1, 0) = 1
A

sha
Bu
EUCLID(a, b)
1. A ← a; B ← b
2. if B = 0 return A = gcd(a, b)
3. R = A mod B
4. A ← B
5. B ← R
6. goto 2 E
EG
LL
O
C
To find gcd(1970, 1066) G
G
EN
A B EA R
KM
1970 1066
E, 904
C
1066 AP, 904
E
162
.,
904 A . R 162 94
a
162shar 94 68
u
94B 68 26
68 26 16
26 16 10
16 10 6
10 6 4
6 4 2
4 2 0
HOME WORK
a. Determine gcd(24140, 16762).
b. Determine gcd(4655, 12075).

E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 4. Finite Fields of the form GF(p)

Finite Fields of Order p

For a given prime, p, the finite field of
order p, GF(p) is defined as the set Zp of
integers {0, 1,..., p 1}, together with the
arithmetic operations modulo p.E
LEG
L
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
Finding the Multiplicative Inverse in GF(p)

EXTENDED EUCLID(m, b)
1. (A1, A2, A3) ← (1, 0, m);
(B1, B2, B3) ← (0, 1, b)
2. if B3 = 0 return A3 = gcd(m, b); no inverse
3. if B3 = 1 return B3 = gcd(m, b);
E
G
B2 ← M.I of b mod m LL
E
O
4. Q = A3 / B3 G
C
G
5. (T1, T2, T3) = (A1 - QB1, AA2
EN - QB2, A3 - QB3)
E
6. (A1, A2, A3) ← (B1, B2, K B3)
M
E,
C
7. (B1, B2, B3) ← (T1, ,P ET2, T3)
.,A
8. goto 2 A.
R

ara
ush
B
1. Find the Multiplicative Inverse of 550 mod
1759
 E
EG
LL
O
C
G
G
EN
EA
Step 1: , KM
E
T1 = 1-3*0 = 1 EC
AP,
.,
T2 = 0-3*1 = -3 A. R
ra
T3 = 1759 - 3*550
sha = 109
Step 2: Bu

T1 = 0-5*1 = -5
T2 = 1-5*-3 = 16
T3 = 550 - 5*109 = 5
Step 3:
T1 = 1-21*-5 = 106
T2 = -3-21*16 = -339
T3 = 109 - 21*5 = 4
Step 4:
T1 = -5-1*106 = -111
T2 = 16-1*-339 = 355
T3 = 5- 1*4 = 1

The Multiplicative Inverse of 550 mod 1759

E
is 355 LE
G
L
O
C
G
G
EN
EA
HomeWork KM
E,
Using the extended , Euclidean
EC algorithm, find
AP
the multiplicative. Rinverse of
.,
A
ra
sha
a. 1234 mod
Bu 4321
b. 24140 mod 40902
c. 550 mod 1769
6. Polynomial arithmetic

E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
Addition and subtraction are performed by adding or subtracting
corresponding coefficients.

E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
Multiplicative Inverse of a Polynomial Arithmetic

E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B
 E
EG
LL
O
C
G
G
EN
EA
, KM
E
EC
AP,
,
. R.
A
ara
ush
B