MODULAR

ARITHMETIC
BUSLAY, SHERLYN
TOCABEN, JUDY ANN
 MODULAR ARITHMETIC
• A branch of arithmetic mathematics related with he “mod”
functionality
• System of arithmetic for integers
• Wrap around after reaching a certain value called modulus.
CONGRUENCE
• In cryptography, congruence (≡) is used instead of equality (=).
Examples:
15 ≡ 3 (mod 12)
23 ≡ 11 (mod 12)
33 ≡ 3 (mod 10)
10 ≡ -2 (mod 12)
… a ≡ b (mod m) or a = km + b
VALID OR INVALID CONGRUENCE
38 ≡ 2 (mod 12)
38 ≡ 14 (mod 12)
5 ≡ 0 ( mod 5)
10 ≡ 2 (mod 6)
13 ≡ 3 (mod 13)
2 ≡ -3 (mod 5)
PROPERTIES OF MODULAR ARITHMETIC

1. [(a mod n) + (b mod n)] mod n = (a + b) mod n

Example: [(15 mod 8) + (11 mod 8)] mod 8 = (15 + 11) mod 8
= 26 mod 8
=2
2. [(a mod n) - (b mod n)] mod n = (a - b) mod n
Example: [(55 mod 5) - (21 mod 5)] mod 5 = (55 - 21) mod 5
= 34 mod 5
=4
3. [(a mod n) x (b mod n)] mod n = (a x b) mod n
Example: [(16 mod 7) x (12 mod 7)] mod 7 = (16 x 12) mod 7
= 192 mod 7
=3
 Properties of Modular Arithmetic
Property Expression

Commutative Laws (a + b) mod n = (b + a) mod n

(a x b) mod n = (b x a ) mod n

Associative Laws [(a + b) + c] mod n = [a + (b + c)] mod n

[(a x b) x c] mod n = [a x (b x c)] mod n

Distributive Laws [a x (b + c)] mod n = [( a x b) + ( a x c)] mod n

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

(1 x a) mod n = a mod n

Additive Inverse For each a€exists a ‘-a’ such that

a + (-a) ≡ 0 mod n