L-5. Modular Arithmetic

Introduction to
Cryptography
Lecture 5
2-2 MODULAR ARITHMETIC
The division relationship (a = q × n + r) discussed in the

previous section has two inputs (a and n) and two outputs
(q and r). In modular arithmetic, we are interested in
only one of the outputs, the remainder r.
Topics discussed in this section:

2.2.1 Modular Operator
2.2.2 Set of Residues
2.2.3 Congruence
2.2.4 Operations in Zn
2.2.5 Addition and Multiplication Tables
2.2.6 Different Sets 2
2.2.1 Modulo Operator
The modulo operator is shown as mod. The second

input (n) is called the modulus. The output r is
called the residue.
Division algorithm and modulo operator

3
2.1.4 Continued
Example
Find the result of the following operations:
a. 27 mod 5 b. 36 mod 12
c. −18 mod 14 d. −7 mod 10
Solution
a. Dividing 27 by 5 results in r = 2
b. Dividing 36 by 12 results in r = 0.
c. Dividing −18 by 14 results in r = −4. After adding
the modulus r = 10
d. Dividing −7 by 10 results in r = −7. After adding
the modulus to −7, r = 3.
4
2.2.2 Set of Residues
The modulo operation creates a set, which in

modular arithmetic is referred to as the set of least
residues modulo n, or Zn.
Some Zn sets
5
2.2.3 Congruence
To show that two integers are congruent, we use

the congruence operator (≡).
Example
6
2.2.3 Continued
Congruences have the following properties:

1. a  b (mod n) if n|(a-b).
2. a  b (mod n) implies b  a (mod n).
3. a  b (mod n) and b  c (mod n) imply a  c
(mod n).
Example
23  8 (mod 5) because 23-8 = 15 = 5 × 3
21  5 (mod 8) because 21-5 = 16 = 8 × 2
81  0 (mod 27) because 81-0 = 81 = 27 × 3

7
2.2.3 Continued
Concept of congruence
8
2.2.3 Continued
Residue Classes
A residue class [a] or [a]n is the set of integers congruent
modulo n.
Example
For n=5,
9
2.2.3 Continued
Comparison of Z and Zn using graphs

Example
We use modular arithmetic in our daily life; for
example, we use a clock to measure time. Our clock
system uses modulo 12 arithmetic. However, instead of
a 0 we use the number 12. 10
2.2.4 Operation in Zn
The three binary operations that we discussed for the set
Z can also be defined for the set Zn. The result may need
to be mapped to Zn using the mod operator.
Binary operations in Zn
11
2.2.4 Continued
Example
Perform the following operations (the inputs come from
Zn):
a. Add 7 to 14 in Z15.
b. Subtract 11 from 7 in Z13.
c. Multiply 11 by 7 in Z20.
Solution
12
2.2.4 Continued
Example
Perform the following operations (the inputs come
from either Z or Zn):
a. Add 17 to 27 in Z14.
b. Subtract 43 from 12 in Z13.
c. Multiply 123 by −10 in Z19.
Solution
(17 + 27) mod 14 → 34 mod 14 = 6

(43 – 12) mod 13 → 31 mod 13 = 5
(123 × (−10)) mod 19 → –1230 mod 19 = 5
13
2.2.4 Continued
Properties
14
2.2.4 Continued
Properties of mod operator
15
2.2.4 Continued
Example
The following shows the application of the above

properties:
1. (1,723,345 + 2,124,945) mod 11 = (8 + 9) mod 11 = 6
2. (1,723,345 − 2,124,945) mod 16 = (8 − 9) mod 11 = 10
3. (1,723,345 × 2,124,945) mod 16 = (8 × 9) mod 11 = 6
16
2.2.4 Continued
Example
In arithmetic, we often need to find the remainder of

powers of 10 when divided by an integer.
Example
10001 mod 7= ?
5
17
2.2.4 Continued
Example
Exponentiation is performed by repeated
multiplication, as in ordinary arithmetic.
To find 117 mod 13, we can proceed as follows:

112 = 121 = 4 (mod 13)
114 = (112)2 = 42 = 3 (mod 13)
117 = 11 x 4 x 3 =132 = 2 (mod 13)
18
2.2.4 Continued
Example
We have been told in arithmetic that the remainder of
an integer divided by 3 is the same as the remainder of
the sum of its decimal digits. We write an integer as the
sum of its digits multiplied by the powers of 10.
19
Properties of Modular Arithmetic
Property Expression
Commutative laws (w + x) mod n = (x + w) mod n
(w * x) mod n = (x * w) mod n
Associative laws [(w + x) + y] mod n = [w + (x + y)] mod n

[(w * x) * y] mod n = [w * (x * y)] mod n
Distributive laws [w * (x + y)] mod n = [(w * x) + (w * y)] mod n

[w + (x * y)] mod n = [(w + x) * (w + y)] mod n
Identities (0 + w) mod n = w mod n

(1 * w) mod n = w mod n
Additive inverse For each wZn, there exists a z such that

(-w) w + z  0 mod n
Multiplicative For each wZn, there exists a z such that

inverse (w-1) w . z  1 mod n
20
2.2.5 Inverses
• When we are working in modular arithmetic,

we often need to find the inverse of a number
relative to an operation.
• an additive inverse (relative to an addition
operation) or
• a multiplicative inverse (relative to a
multiplication operation).
21
2.2.5 Continue
Additive Inverse
In Zn, two numbers a and b are additive inverses of
each other if
Note
In modular arithmetic, each integer has

an additive inverse. The sum of an
integer and its additive inverse is
congruent to 0 modulo n.
22
2.2.5 Continued
Example
Find all additive inverse pairs in Z7.
Solution
The four pairs of additive inverses are (0, 0), (1, 6),
(2, 5), and (3, 4).
Find all additive inverse pairs in Z10.
Solution
The six pairs of additive inverses are (0, 0), (1, 9), (2,
8), (3, 7), (4, 6), and (5, 5).
23
2.2.5 Continue
Multiplicative Inverse
In Zn, two numbers a and b are the multiplicative
inverse of each other if
Note
In modular arithmetic, an integer may or

may not have a multiplicative inverse.
When it does, the product of the integer
and its multiplicative inverse is
congruent to 1 modulo n.
24
2.2.5 Continued
Example
Find the multiplicative inverse of 8 in Z10.
Solution
There is no multiplicative inverse because GCD(10, 8)
= 2 ≠ 1. In other words, we cannot find any number
between 0 and 9 such that when multiplied by 8, the
result is congruent to 1.
Example
Find all multiplicative inverses in Z10.
Solution
There are only three pairs: (1, 1), (3, 7) and (9, 9). The
numbers 0, 2, 4, 5, 6, and 8 do not have a
multiplicative inverse.
25
References
◼ Chapter 2 & 4 - Behrouz A Forouzan,

Debdeep Mukhopadhyay, Cryptography
and Network Security, Mc Graw Hill, 3rd
Edition, 2015.
◼ Chapter 4 - William Stallings,

Cryptography and Network Security
Principles and Practices, 7th Edition,
Pearson Education, 2017.

L-5. Modular Arithmetic

Uploaded by

Copyright:

Available Formats

L-5. Modular Arithmetic

Uploaded by

Document Information

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

L-5. Modular Arithmetic

Uploaded by

Copyright:

Available Formats

Introduction to

The division relationship (a = q × n + r) discussed in the

Topics discussed in this section:

The modulo operator is shown as mod. The second

Division algorithm and modulo operator

The modulo operation creates a set, which in

To show that two integers are congruent, we use

Congruences have the following properties:

21  5 (mod 8) because 21-5 = 16 = 8 × 2

81  0 (mod 27) because 81-0 = 81 = 27 × 3

Comparison of Z and Zn using graphs

(17 + 27) mod 14 → 34 mod 14 = 6

Properties of mod operator

The following shows the application of the above

1. (1,723,345 + 2,124,945) mod 11 = (8 + 9) mod 11 = 6

2. (1,723,345 − 2,124,945) mod 16 = (8 − 9) mod 11 = 10

3. (1,723,345 × 2,124,945) mod 16 = (8 × 9) mod 11 = 6

In arithmetic, we often need to find the remainder of

To find 117 mod 13, we can proceed as follows:

Associative laws [(w + x) + y] mod n = [w + (x + y)] mod n

Distributive laws [w * (x + y)] mod n = [(w * x) + (w * y)] mod n

Identities (0 + w) mod n = w mod n

Additive inverse For each wZn, there exists a z such that

Multiplicative For each wZn, there exists a z such that

• When we are working in modular arithmetic,

In modular arithmetic, each integer has

Find all additive inverse pairs in Z7.

Find all additive inverse pairs in Z10.

In modular arithmetic, an integer may or

◼ Chapter 2 & 4 - Behrouz A Forouzan,

◼ Chapter 4 - William Stallings,

You might also like