Lecture 3

Secure Communication

Dr. Aswathy G P
Assistant Professor
Department of ECE
TKM College of Engineering

5 April 2021

Aswathy G P Class Presentations 1 / 16

Contents

1 Divisibility

2 The Division Algorithm

3 Greatest Common Divisor

4 Subject Coverage

Aswathy G P Class Presentations 2 / 16

Divisibility

A nonzero b divides a if a = mb for some m, where a, b, and

m are integers
That is, b divides a if there is no remainder on division
The notation b|a is commonly used to mean b divides a
Also, if b|a, we say that b is a divisor of a

Aswathy G P Class Presentations 3 / 16

Example 1

5|10
a = 10; b = 5; m = 2
5|10 means 10 = 2×5
5 is a divisor of 10

Aswathy G P Class Presentations 4 / 16

Example 2

13|182
a = 182; b = 13; m = 14
13|182 means 182 = 14×13
13 is a divisor of 182

Aswathy G P Class Presentations 5 / 16

Example 3

-5|30
a = 30; b = -5; m = -6
-5|30 means 30 = -6×-5
-5 is a divisor of 30

Aswathy G P Class Presentations 6 / 16

Example 4

What are the positive divisors of 24?

24 = 24×1 → 1|24
24 = 12×2 → 2|24
24 = 8×3 → 3|24
24 = 6×4 → 4|24
24 = 4×6 → 6|24
24 = 3×8 → 8|24
24 = 2×12 → 12|24
24 = 1×24 → 24|24
1, 2, 3, 4, 6, 8, 12 and 24 are divisors of 24

Aswathy G P Class Presentations 7 / 16

Properties of Divisibility

If a|1, then a = ±1
If a|b and b|a, then a = ±b
Any b 6= 0 divides 0
If a|b and b|c, then a|c
If b|g and b|h, then b|(mg + nh) for arbitrary integers m and
n

Aswathy G P Class Presentations 8 / 16

Example 5

Check whether 11|66 and 66|198 = 11|198.

11|66 means 66 = 6×11
66|198 means 198 = 3×66
11|198 means 198 = 18×11
⇒ 11|66 and 66|198 = 11|198

Aswathy G P Class Presentations 9 / 16

The Division Algorithm

Given any positive integer n and any nonnegative integer a, if

we divide a by n, we get an integer quotient q and an integer
remainder r that obey the following relationship:

a = qn + r 0 ≤ r < n; q = ba/nc (1)

bx c is the largest integer less than or equal to x

Equation 1 is referred to as the division algorithm
The remainder r is often referred to as a residue

Aswathy G P Class Presentations 10 / 16

Example 6

5|31
a = 31; n = 5; q = 6; r = 1
a = q × n + r ⇒ 31 = 6×5 + 1
0 ≤ 1 < 5 and 6 = b31/5c

Aswathy G P Class Presentations 11 / 16

Greatest Common Divisor

A nonzero b is defined to be a divisor of a if a = mb for some

m, where a, b, and m are integers
gcd(a, b) = greatest common divisor of a and b
The greatest common divisor of a and b is the largest integer
that divides both a and b
gcd(0, 0) = 0
The positive integer c is said to be the greatest common divisor
of a and b if
1 c is a divisor of a and of b
2 Any divisor of a and b is a divisor of c

Aswathy G P Class Presentations 12 / 16

Example 7

Find the gcd(60, 24)?

Let a = 60 and b = 24
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30 and 60 are the positive
divisors of 60
1, 2, 3, 4, 6, 8, 12 and 24 are the positive divisors of 24
Therefore, 12 is the greatest common divisor of 60 and 24
c = gcd(60, 24) = 12
Also note that {1, 2, 3, 4, 6 and 12} are the positive divisors
of 12 which are also the positive divisors of both 60 and 24

Aswathy G P Class Presentations 13 / 16

Greatest Common Divisor

An equivalent definition is the following:

gcd(a, b) = gcd(a, -b) = gcd(-a, b) = gcd(-a, -b)
In general, gcd(a, b) = gcd(| a | , | b |)
Also, because all nonzero integers divide 0, we have gcd(a, 0)
=|a|
Two integers a and b are relatively prime if and only if their
only common positive integer factor is 1 i.e., gcd(a, b) = 1

Aswathy G P Class Presentations 14 / 16

Example 8

Find the gcd(8, 15)?

Let a = 8 and b = 15
1, 2, 4 and 8 are the positive divisors of 8
1, 3, 5 and 15 are the positive divisors of 15
Therefore, 1 is the greatest common divisor of 8 and 15
c = gcd(8, 15) = 1
⇒ 8 and 15 are relatively prime numbers

Aswathy G P Class Presentations 15 / 16

Subject Coverage

Module 2

Modular arithmetic: Groups, Ring, Fields. The Euclidean algorithm,

Finite fields of the form GF(p).Polynomial arithmetic: Finite fields
of the form GF (2n).

Aswathy G P Class Presentations 16 / 16