CSI3022 – Cyber Security and Application

Security

1
Euler’s Theorem

624 mod 35=?

2
 Euler’s Theorem

624 mod 35=?

Φ(35)= Φ(7*5)
= Φ(7) * Φ(5)
=6*4
= 24
Φ(35) = 24
So
624 mod 35 = 6Φ(35) mod 35
=1
624 mod 35 = 1

3
Euler’s Theorem

2062mod77=?

4
 Euler’s Theorem
2062mod77=?
Φ(77) = Φ(7*11)
= Φ(7)* Φ(11)
= 6 * 10 , 7 & 11 are relatively prime
= 60
Φ(n) = Φ(77) = 60
Therefore, 2062mod77 =2060+2mod 77
=2060 * 202 mod 77
=20Φ(77) * 202 mod 77
= 20Φ(77) mod 77 * 202mod 77
= 1 * 202mod 77
= 400 mod 77
= 77 * 5 +15 mod 77
= 15 mod 77
=15
2062mod77 = 15 5
 Euler’s Theorem
• 250 mod 17= ?
• 4532 mod 11= ?
• 21115 mod 29= ?
• 3202 mod 13= ?
• 499 mod 35= ?
• 512mod 36= ?
• 344mod 10= ?
• 730mod 15= ?

6
Euler’s Theorem

250 mod 17=?

7
 Euler’s Theorem

250 mod 17 = ?
Φ(17) = 17-1
= 16
250 mod 17 = 216*3+2 mod 17
= 216*3 mod 17 * 22 mod 17
= (216)3 mod 17 * 22 mod 17 --- aϕ(n) mod n ≡ 1 , gcd(2,17)=1
= (1)3 * 4 mod 17
= 4 mod 17

250 mod 17 = 4

8
Euler’s Theorem

4532 mod 11= ?

9
 Euler’s Theorem
4532 mod 11= ?
Φ(11) = 11-1
= 10
4532 mod 11= 453*10+2 mod 11
= 453*10 mod 11 * 42 mod 11
= (410)53 mod 11 * 42 mod 11 --- aϕ(n) mod n ≡ 1, gcd(4,11)=1
= (1)53 * 16 mod 11
= 16 mod 11
=5

4532 mod 11 = 5
10
Euler’s Theorem

21115 mod 29=?

11
21115 mod 29= ?
Φ(29) = 29-1
Euler’s Theorem
= 28
21115 mod 29 = 214*28+3 mod 29
= 214*28 mod 29 * 213 mod 29
= (2128)4 mod 29 * 213 mod 29 --- aϕ(n) mod n ≡ 1, gcd(21,29)=1
= (1)4 * 213 mod 29
= 213 mod 29
= 212 mod 29 * 211 mod 29
= 441 mod 29 * 211 mod 29
= (29*15+6) mod 29 * 21 mod 29
= 6 * 21 mod 29
= 126 mod 29
= (4*29+10) mod 29
= 10

21115 mod 29 = 10 12
Euler’s Theorem

3202 mod 13=?

13
3202 mod 13= ?
Φ(13) = 13-1
Euler’s Theorem
= 12
3202 mod 13 = 3202 mod 13
= 312*16+10 mod 13
= 312*16 mod 13 * 310 mod 13 --- aϕ(n) mod n ≡ 1, gcd(3,13)=1
= (312)16 mod 13 * 310 mod 13
= (1)16 * 310 mod 13
= 310 mod 13
= 33 mod 13 *33 mod 13 * 33 mod 13 * 31 mod 13
= 27 mod 13 * 27 mod 13 * 27 mod 13 *3 mod 13
= 1 * 1 * 1 * 3 mod 13
= 3 mod 13
=3

3202 mod 13 = 3 14
Euler’s Theorem

499 mod 35=?

15
 Euler’s Theorem
499 mod 35=?
Φ(35) = Φ(7 *5)
= Φ(7) * Φ(5)
=6*4
= 24
Φ(35) = 24
499 mod 35 = 44*24 mod 35 * 43 mod 35
= (424)4 mod 35 * 43 mod 35 --- aϕ(n) mod n ≡ 1, gcd(4,35)=1
= (1)4 * 43 mod 35
= 43 mod 35
= 64 mod 35
= 29

499 mod 35 = 29 16
Euler’s Theorem

512mod 36=?

17
 Euler’s Theorem
512 mod 36=?
Φ(36) = Φ(36)
= Φ(9*4)
= Φ(32*22)
= Φ(32) * Φ(22)
= (32 - 31) * (22 - 21)
= (9-3) * (4-2)
=6*2
= 12
Φ(36) = 12
512 mod 36 = 512 mod 36 --- aϕ(n) mod n ≡ 1, gcd(5,36)=1
=1

512 mod 36 = 1 18
Euler’s Theorem

344mod 10=?

19
344 mod 10 = ?
Φ(10) = Φ(2*5) Euler’s Theorem
= Φ(2) * Φ(5)
=1*4
=4
Φ(10) = 4
344 mod 10 =34*10+4 mod 10
= 34*10 mod 10 * 34 mod 10
= (34)10 mod 10 * 34 mod 10 --- aϕ(n) mod n ≡ 1, gcd(3,10)=1
= (1)10 * 34 mod 10
= 34 mod 10
= 33 mod 10 * 31 mod 10
= 27 mod 10 * 31 mod 10
= 7 * 3 mod 10
= 21 mod 10
=1
20
344 mod 10 = 1
Euler’s Theorem

730mod 15=?

21
730mod 15=? Euler’s Theorem
Φ(15) = Φ(3*5)
= Φ(3) * Φ(5)
730mod 15 = 73*8+6 mod 15
=2*4
= 73*8 mod 15 * 76 mod 15
=8
= (78)3 mod 15 * 76 mod 15 -- aϕ(n) mod n ≡ 1, gcd(7,15)=1
Φ(15) = 8
= (1)3 * 76 mod 15
= 76 mod 15
= 72 mod 15 * 72 mod 15 *72 mod 15
= 49 mod 15 * 49 mod 15 * 49 mod 15
= (3*15+4) mod 15 * (3*15+4) mod 15 * (3*15+4) mod 15
= 4 * 4 * 4 mod 15
= 64 mod 15
= (4*15+4) mod 15
= 4 mod 15
=4
22
730mod 15 = 4
 Euler’s Theorem
• 250 mod 17= 4
• 4532 mod 11= 5
• 21115 mod 29= 10
• 3202 mod 13= 3
• 499 mod 35= 29
• 512mod 36= 1
• 344mod 10= 1
• 730mod 15= 4

23
Euler’s Theorem

24
 -1
2 mod 7=?

25
 -1
2 mod 7 =?

26
Using Euler’s Theorem -1
2 mod 7 =?

2-1 mod 7= 2ϕ(7)-1 mod 7

Φ(7)=7-1 = 6

2-1 mod 7 = 26-1 mod 7

= 25 mod 7
= 23 * 22 mod 7
= 8 * 4 mod 7
= 8 mod 7 * 4 mod 7
= 1 * 4 mod 7
=4
2-1 mod 7 = 4 27
Using Fermat’s Theorem -1
2 mod 7 =?

2-1 mod 7 = 27-2 mod 7

= 25 mod 7
= 23 * 22 mod 7
= 8 * 4 mod 7
= 8 mod 7 * 4 mod 7
= 1 * 4 mod 7
=4
2-1 mod 7 = 4
28
 -1
2 mod 7=?
Using Extended Euclidean Algorithm

2-1 mod 7 = -3 mod 7

= 7+(-3) mod 7 (to represent as positive number add 7 and (-3)
= 4 mod 7

2-1 mod 7 = 4
29
Euler’s Theorem

30
Eulers Theorem

31
Eulers Theorem

32