Arithmétique dans ℤ et

cryptographie
Table des matières ......................................................................................................................................................... 1
I. Division euclidienne et pgcd ................................................................................................................................... 2
1. Divisibilité et division euclidienne ...................................................................................................................... 2
2. pgcd de deux entiers .......................................................................................................................................... 3
3. Algorithme d’Euclide .......................................................................................................................................... 3
4. Nombres premiers entre eux ............................................................................................................................. 4
II. Théorème de Bézout .............................................................................................................................................. 4
1. Théorème de Bézout .......................................................................................................................................... 4
2. Corollaires du théorème de Bézout.................................................................................................................... 5
3. Équations 𝒂𝒙 + 𝒃𝒚 = 𝒄 dans ℤ .......................................................................................................................... 6
4. ppcm de deux entiers ......................................................................................................................................... 7
III. Nombres premiers .............................................................................................................................................. 8
1. Une infinité de nombres premiers ..................................................................................................................... 8
2. Eratosthène et Euclide........................................................................................................................................ 9
3. Décomposition en facteurs premiers ................................................................................................................. 9
IV. Congruences ..................................................................................................................................................... 11
1. Définition .......................................................................................................................................................... 11
2. Équation de congruence 𝒂𝒙 ≡ 𝒃 (𝒎𝒐𝒅 𝒏) ................................................................................................... 12
3. Petit théorème de Fermat ................................................................................................................................ 13
V. L’arithmétique pour RSA ...................................................................................................................................... 14
1. La méthode de codage RSA .............................................................................................................................. 14
2. Le petit théorème de Fermat amélioré ............................................................................................................ 14
3. Inverse modulo 𝒏 ............................................................................................................................................. 15
4. L’exponentiation rapide ................................................................................................................................... 16
VI. Le chiffrement RSA ........................................................................................................................................... 16
1. Chiffrement du message .................................................................................................................................. 18
2. Déchiffrement du message .............................................................................................................................. 19
3. Schéma ............................................................................................................................................................. 20
4. Lemme de déchiffrement ................................................................................................................................. 20
5. Application de RSA ........................................................................................................................................... 21
a. Génération des clés ...................................................................................................................................... 21
b. Chiffrement................................................................................................................................................... 21
c. Déchiffrement............................................................................................................................................... 22
d. Annexe: les caractères 𝐴𝑆𝐶𝐼𝐼: 7-bit ............................................................................................................. 22
 𝑎, 𝑏 ∈ ℤ 𝑏 𝑎 𝑏|𝑎 𝑞 ∈ ℤ 𝑎 = 𝑏𝑞

7|21 6|48 𝑎 2|𝑎

𝑎 ∈ ℤ 𝑎|0 1|𝑎
𝑎|1 𝑎 = +1 𝑎 = −1
𝑎|𝑏 𝑏|𝑎 ⇒ 𝑏 = ±𝑎
𝑎|𝑏 𝑏|𝑐 ⇒ 𝑎|𝑐.
𝑎|𝑏 𝑎|𝑐 ⇒ 𝑎|(𝑏 + 𝑐)

𝑎 ∈ ℤ 𝑏 ∈ ℕ\ {0} 𝑞, 𝑟 ∈ 𝑍
𝑎 = 𝑏𝑞 + 𝑟 𝑒𝑡 0 ≤ 𝑟 < 𝑏
𝑞 𝑟

𝑎≥0
𝒩 = { 𝑛 ∈ ℕ | 𝑏𝑛 ≤ 𝑎} 𝑛 = 0 ∈𝒩 ∈𝒩
𝑛≤𝑎 𝒩 𝑞 = max 𝒩
𝑞𝑏 ≤ 𝑎 ∈𝒩 (𝑞 + 1)𝑏 > 𝑎 𝑞+1 ∉𝒩 𝑞𝑏 ≤ 𝑎 < (𝑞 + 1)𝑏 = qb + b
𝑟 = 𝑎 − 𝑞𝑏 𝑟 0 ≤ 𝑟 = 𝑎 − 𝑞𝑏 < 𝑏

𝑞′, 𝑟′
𝑎 = 𝑏𝑞 + 𝑟 = 𝑏𝑞′ + 𝑟′ 𝑏(𝑞 − 𝑞′ ) = 𝑟′ − 𝑟
0 ≤ 𝑟′ < 𝑏 0≤𝑟<𝑏 −𝑏 < 𝑟′ − 𝑟 < 𝑏 𝑟′ − 𝑟 = 𝑏(𝑞 − 𝑞′)
−𝑏 < 𝑏(𝑞 − 𝑞′) < 𝑏
𝑏>0 −1 < 𝑞 − 𝑞′ < 1 𝑞 − 𝑞′
𝑞 − 𝑞′ = 0 = 𝑞′ 𝑟′ − 𝑟 = 𝑏(𝑞 − 𝑞′) 𝑟=
𝑟′
∎

𝑟=0 𝑏 𝑎
 𝑞 𝑟 𝑎 = 6789 𝑏 = 34 6789 = 34 ×
199 + 23 0 ≤ 23 < 34

𝑎, 𝑏 ∈ ℤ 𝑎 𝑏
𝑎, 𝑏 𝑝𝑔𝑐𝑑(𝑎, 𝑏) 𝑎⋀𝑏

𝑝𝑔𝑐𝑑(21,14) = 7 𝑝𝑔𝑐𝑑(12,32) = 4 𝑝𝑔𝑐𝑑(21,26) = 1

𝑝𝑔𝑐𝑑(𝑎, 𝑘𝑎) = 𝑎 𝑘 ∈ ℤ 𝑎≥0
𝑎 ≥ 0 𝑝𝑔𝑐𝑑(𝑎, 0) = 𝑎 𝑝𝑔𝑐𝑑(𝑎, 1) = 1

,𝑏 ∈ ℕ 𝑎 = 𝑏𝑞 + 𝑟
𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑏, 𝑟)

𝑎 𝑏 𝑏
𝑟

 𝑑 𝑎 𝑏 𝑑 𝑏 𝑏𝑞 𝑑 𝑎 𝑑
𝑏𝑞 − 𝑎 = 𝑟
 𝑑 𝑏 𝑟 𝑑 𝑏𝑞 + 𝑟 = 𝑎
∎

𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑏, 𝑎 − 𝑞𝑏) 𝑞∈ℤ

𝑞

𝑝𝑔𝑐𝑑 𝑎, 𝑏 ∈ ℕ∗ 𝑎≥𝑏
𝑝𝑔𝑐𝑑
𝑎 𝑏 𝑎 = 𝑏𝑞1 + 𝑟1 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑏, 𝑟1 ) 𝑟1 = 0
𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑏
 𝑏 = 𝑟1 𝑞2 + 𝑟2 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑏, 𝑟1 ) = 𝑝𝑔𝑐𝑑(𝑟1 , 𝑟2 )
 𝑟1 = 𝑟2 𝑞3 + 𝑟3 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑏, 𝑟1 ) = 𝑝𝑔𝑐𝑑(𝑟2 , 𝑟3 )
 …
 𝑟𝑘−2 = 𝑟𝑘−1 𝑞𝑘 + 𝑟𝑘 𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑟𝑘−1 , 𝑟𝑘 )
 𝑟𝑘−1 = 𝑟𝑘 𝑞𝑘+1 + 0 𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑟𝑘 , 0) = 𝑟𝑘
0 ≤ 𝑟𝑖+1 < 𝑟𝑖

𝑏 > 𝑟1 > 𝑟2 >. . . ≥ 0

𝑎 = 600 𝑏 = 124
600 = 124 × 4 + 104
124 = 104 × 1 + 20
104 = 20 × 5 + 𝟒
20 = 4 × 5 + 0
𝑝𝑔𝑐𝑑(600,124) = 4

𝑎, 𝑏 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 1

𝑎 ∈ ℤ 𝑎 𝑎+ 1 𝑑
𝑎 𝑎+1 𝑎+1− 𝑎 𝑑 1 𝑑 = −1 𝑑 =
+1 𝑎 𝑎+1 1 𝑝𝑔𝑐𝑑(𝑎, 𝑎 + 1) = 1

𝑎, 𝑏 ∈ ℤ 𝑑 = 𝑝𝑔𝑐𝑑(𝑎, 𝑏)

{𝑎 = 𝑎′𝑑 𝑎′ , 𝑏′ ∈ ℤ 𝑝𝑔𝑐𝑑(𝑎′, 𝑏′) = 1

𝑏 = 𝑏′𝑑

𝑎, 𝑏 𝑢, 𝑣 ∈ ℤ
𝑎𝑢 + 𝑏𝑣 = 𝑝𝑔𝑐𝑑(𝑎, 𝑏)

𝑢, 𝑣 𝑢, 𝑣
 𝑎 = 600 𝑏 = 124
𝑝𝑔𝑐𝑑(600,124) = 4

600 = 124 × 4 + 104 4 = 124 × (−5) + (600 − 124 × 4) × 6 = 600 × 6 + 124 × (−29)
124 = 104 × 1 + 20 4 = 104 − (124 − 104 × 1) × 5 = 124 × (−5) + 104 × 6
104 = 20 × 5 + 4 4 = 104 − 20 × 5
20 = 4 × 5 + 0
𝑢 = 6 𝑣 = −29 600 × 6 + 124 × (−29) = 4

𝑑|𝑎 𝑑|𝑏 𝑑|𝑝𝑔𝑐𝑑(𝑎, 𝑏)

𝑑|𝑎𝑢 𝑑|𝑏𝑣 𝑑|𝑎𝑢 + 𝑏𝑣 𝑑|𝑝𝑔𝑐𝑑(𝑎, 𝑏)

∎

𝑎, 𝑏 𝑎, 𝑏 𝑢, 𝑣 ∈ ℤ
𝑎𝑢 + 𝑏𝑣 = 1

⇒
⇐ 𝑢, 𝑣 𝑎𝑢 + 𝑏𝑣 = 1 𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑎
𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑎𝑢 𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑏𝑣 𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑎𝑢 + 𝑏𝑣 = 1 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 1
∎

𝑢 ,𝑣 𝑎𝑢 + 𝑏𝑣 = 𝑑 𝑑 = 𝑝𝑔𝑐𝑑(𝑎, 𝑏)
𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑑 𝑎 = 12, 𝑏 = 8; 12 × 1 + 8 × 3 = 36
𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 4

𝑎, 𝑏, 𝑐 ∈ ℤ.
𝑎|𝑏𝑐 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 1 𝑎|𝑐

𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 1 𝑢, 𝑣 ∈ ℤ 𝑎𝑢 + 𝑏𝑣 = 1 𝑐
𝑎𝑐𝑢 + 𝑏𝑐𝑣 = 𝑐
 𝒂𝒙 𝒃𝒚 𝒄 ℤ
𝑎|𝑎𝑐𝑢 𝑎|𝑏𝑐𝑣 𝑎 𝑎𝑐𝑢 + 𝑏𝑐𝑣 = 𝑐
∎

𝒂𝒙 + 𝒃𝒚 = 𝒄 ℤ

𝑎𝑥 + 𝑏𝑦 = 𝑐 (𝐸)
𝑎, 𝑏, 𝑐 ∈ ℤ
(𝐸) (𝑥, 𝑦) ∈ ℤ2 𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑐
𝑝𝑔𝑐𝑑(𝑎, 𝑏)|𝑐
(𝑥, 𝑦) = (𝑥0 + 𝛼𝑘, 𝑦0 + 𝛽𝑘) 𝑥0 , 𝑦0 , 𝛼, 𝛽 ∈ ℤ 𝑘 ℤ

161𝑥 + 368𝑦 = 115 (𝐸)

𝑝𝑔𝑐𝑑 𝑎 = 161 𝑏 = 368.

368 = 161 × 2 + 46
161 = 46 × 3 + 𝟐𝟑
46 = 23 × 2 + 0
𝑝𝑔𝑐𝑑(368,161) = 23 115 = 5 × 23 𝑝𝑔𝑐𝑑(368,161)|115
(𝐸)

368 = 161 × 2 + 46 23 = 161 + (368 − 2 × 161) × (−3) = 161 × 7 + 368 × (−3)

161 = 46 × 3 + 𝟐𝟑 23 = 161 − 3 × 46
46 = 23 × 2 + 0
161 × 7 + 368 × (−3) = 23 115 = 5 × 23 5

161 × 35 + 368 × (−15) = 115

(𝑥0 , 𝑦0 ) = (35, −15) (𝐸)

(𝑥, 𝑦) ∈ ℤ2 (𝐸) (𝑥0 , 𝑦0 )

161𝑥 + 368𝑦 = 115 𝑒𝑡 161𝑥0 + 368𝑦0 = 115
 de deux

161 × (𝑥 − 𝑥0 ) + 368 × (𝑦 − 𝑦0 ) = 0
⇒ 23 × 7 × (𝑥 − 𝑥0 ) + 23 × 16 × (𝑦 − 𝑦0 ) = 0
⇒ 7(𝑥 − 𝑥0 ) = −16(𝑦 − 𝑦0 ) (∗)
7|16(𝑦 − 𝑦0 ) 𝑝𝑔𝑐𝑑(7,16) = 1 7|𝑦 − 𝑦0 𝑘 ∈
ℤ 𝑦 − 𝑦0 = 7 × 𝑘 (∗) 7(𝑥 − 𝑥0 ) = −16(𝑦 − 𝑦0 )
7(𝑥 − 𝑥0 ) = −16 × 7 × 𝑘 𝑥 − 𝑥0 = −16𝑘 𝑘 𝑥 𝑦
(𝑥, 𝑦) = (𝑥0 − 16𝑘, 𝑦0 + 7𝑘) (𝑥0 , 𝑦0 )

161𝑥 + 368𝑦 = 115 (𝑥, 𝑦) = (35 − 16𝑘, −15 + 7𝑘), 𝑘 ∈ ℤ

𝑝𝑝𝑐𝑚(𝑎, 𝑏) ≥0 𝑎 𝑏
𝑎⋁𝑏

𝑝𝑝𝑐𝑚(12,9) = 36

𝑎, 𝑏
𝑝𝑔𝑐𝑑(𝑎, 𝑏) × 𝑝𝑝𝑐𝑚(𝑎, 𝑏) = |𝑎𝑏|

|𝑎𝑏|
d = 𝑝𝑔𝑐𝑑(𝑎, 𝑏) = 𝑝𝑔𝑐𝑑(𝑎,𝑏)

𝑎 > 0 𝑏 > 0
𝑎 = 𝑑𝑎′ 𝑏 = 𝑑𝑏′
𝑎𝑏 = 𝑑2 𝑎′𝑏′ 𝑚 = 𝑑𝑎′𝑏′
𝑚 = 𝑎′𝑏 = 𝑎𝑏′ 𝑎 𝑏

𝑛 𝑎 𝑏 𝑛 = 𝑘𝑎 = 𝑙𝑏 𝑘𝑑𝑎′ = 𝑙𝑑𝑏′ ′ = 𝑙𝑏′

𝑝𝑔𝑐𝑑(𝑎′, 𝑏′) = 1 𝑎′|𝑙𝑏′ 𝑎′|𝑙 𝑎′𝑏|𝑙𝑏 𝑚 = 𝑎′𝑏|𝑙𝑏 = 𝑛
∎

𝑎|𝑐 𝑏|𝑐 𝑝𝑝𝑐𝑚(𝑎, 𝑏)|𝑐

 infinité de
𝑎𝑏|𝑐 6|36 9|36 6×9 36
𝑝𝑝𝑐𝑚(6,9) = 18 36

𝑝 ≥2 1 𝑝

2,3,5,7,11
4 = 2 × 2, 6 = 2 × 3, 8 = 2 × 4

𝑛≥2

𝒟 𝑛 ≥2
𝒟 = {k ≥ 2/ k|n}
𝒟 n∈𝒟 𝑝 = 𝑚𝑖𝑛𝒟
𝑝 𝑝 𝑞
1<𝑞<𝑝 𝑞 𝑛 𝑞∈𝒟 𝑞<𝑝
𝑝 𝑝 𝑝∈𝒟 𝑝
𝑛
∎

𝑝1 =
2, 𝑝2 = 3, 𝑝3 , . . . , 𝑝𝑛 𝑁 = 𝑝1 × 𝑝2 × · · ·× 𝑝𝑛 + 1 𝑝
𝑁 𝑝 𝑝𝑖 |𝑝1 ×
𝑝2 × · · ·× 𝑝𝑛 𝑝|𝑁 𝑝 𝑁 − 𝑝1 × 𝑝2 × · · ·× 𝑝𝑛
𝑝 = 1 𝑝

∎
 et Euclide

2 25
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
𝑛 𝑛 2
1 2 2
2 2
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
3
3 3
(6, 9, 12, . . . )

2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
5 5

2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
7 7
11,13,17,19,23

2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

𝑛 ≤ √𝑛 𝑛 = 𝑎× 𝑏
𝑎, 𝑏 ≥ 2 𝑎 ≤ √𝑛 𝑏 ≤ √𝑛 ≤ 100
≤ 10
2,3,5 7
89 2,3,5,7

𝑝 𝑝|𝑎𝑏 𝑝|𝑎 𝑝|𝑏

𝑝 𝑎 𝑝 𝑎 𝑝 1 𝑝
1 𝑎 𝑝𝑔𝑐𝑑(𝑎, 𝑝) = 1 𝑝|𝑏
∎

𝑛≥2 𝑝1 < 𝑝2 <. . . < 𝑝𝑟

𝛼1 , 𝛼2 , . . . , 𝛼𝑟 ≥ 1
 en facteurs
α1 α2 α
𝑛 = 𝑝1 × 𝑝2 × · · ·× 𝑝𝑟 𝑟 .
𝑝𝑖 𝛼𝑖 𝑖 = 1, . . . , 𝑟

𝑛
𝑛=2
𝑛≥3 < 𝑛
𝑝1 𝑛
𝑛 𝑛 = 𝑝1
𝑛
𝑛′ = 𝑝 < 𝑛 𝑛′
1

𝑛 = 𝑝1 × 𝑛′

𝜎 = ∑𝑟𝑖=1 α𝑖
𝜎=1 𝑛 = 𝑝1
𝜎≥1 <𝜎

𝑛 𝜎

α1 α α𝑟 𝛽 𝛽 𝛽
𝑛 = 𝑝1 × 𝑝2 2 ×· · ·× 𝑝𝑟 = 𝑞1 1 × 𝑞2 2 ×· · ·× 𝑞𝑠 𝑠
𝑝1 < 𝑝2 < · · · 𝑞1 < 𝑞2 < · · ·
α1 α2 α𝑟
𝑝1 < 𝑞1 𝑝1 < 𝑞𝑗 𝑗 = 1, . . . , 𝑠 𝑝1 𝑝1 × 𝑝2 ×· · ·× 𝑝𝑟 =𝑛
𝛽 𝛽 𝛽
𝑞1 1 × 𝑞2 2 ×· · ·× 𝑞𝑠 𝑠 =𝑛 𝑝1 ≥ 𝑞1
𝑝1 > 𝑞1 𝑝1 = 𝑞1
𝑛 α1 −1 α α𝑟 𝛽 𝛽 𝛽
𝑛′ = 𝑝 = 𝑝1 × 𝑝2 2 ×· · ·× 𝑝𝑟 = 𝑞1 1−1 × 𝑞2 2 ×· · ·× 𝑞𝑠 𝑠
1

𝑛′
𝑟=𝑠 𝑝𝑖 = 𝑞𝑖 𝛼𝑖 = 𝛽𝑖 𝑖 = 1, . . . , 𝑟
∎

24 = 23 × 3
36 = 22 × 9 22 × 32
 1
24 = 23 × 3 = 1 × 23 × 3 = 12 × 23 × 3

504 = 2𝟑 × 3𝟐 × 7, 300 = 2𝟐 × 3 × 5𝟐 .

504 = 2𝟑 × 3𝟐 × 5𝟎 × 7𝟏 , 300 = 2𝟐 × 3𝟏 × 5𝟐 × 7𝟎 .

𝑝𝑔𝑐𝑑(504,300) = 2𝟐 × 3𝟏 × 5𝟎 × 7𝟎 = 12.

𝑝𝑝𝑐𝑚(504,300) = 2𝟑 × 3𝟐 × 5𝟐 × 7𝟏 = 12600.

𝑛≥2 𝑎 𝑏 𝑛 𝑛 𝑏−𝑎
𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛).
𝑎 = 𝑏 (𝑚𝑜𝑑 𝑛) 𝑎 ≡ 𝑏[𝑛]
𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) ⇔ ∃𝑘 ∈ ℤ, 𝑎 = 𝑏 + 𝑘𝑛.

𝑛 𝑎 𝑎 ≡ 0 (𝑚𝑜𝑑 𝑛)

𝑛
 𝑎 ≡ 𝑎 (𝑚𝑜𝑑 𝑛),
 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) 𝑏 ≡ 𝑎 (𝑚𝑜𝑑 𝑛)
 ≡ ≡ ≡
𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) 𝑐 ≡ 𝑑 (𝑚𝑜𝑑 𝑛) 𝑎 + 𝑐 ≡ 𝑏 + 𝑑 (𝑚𝑜𝑑 𝑛)
𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) 𝑐 ≡ 𝑑 (𝑚𝑜𝑑 𝑛) 𝑎 × 𝑐 ≡ 𝑏 × 𝑑 (𝑚𝑜𝑑 𝑛)
𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) 𝑘 ≥ 0, 𝑎𝑘 ≡ 𝑏 𝑘 (𝑚𝑜𝑑 𝑛)

15 ≡ 1 (𝑚𝑜𝑑 7) 72 ≡ 2 (𝑚𝑜𝑑 7) 3 ≡ −11 (𝑚𝑜𝑑 7)

5𝑥 + 8 ≡ 3 (𝑚𝑜𝑑 5) 𝑥 ∈ ℤ
122015 ≡ 22015 (𝑚𝑜𝑑 10)
 𝒂𝒙 ≡ 𝒃 𝒎𝒐𝒅 𝒏

𝒂𝒙 ≡ 𝒃 (𝒎𝒐𝒅 𝒏)

𝑎 ∈ ℤ∗ , 𝑏 ∈ ℤ 𝑛≥2 𝑎𝑥 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) 𝑥∈ℤ

𝑝𝑔𝑐𝑑(𝑎, 𝑛)|𝑏
𝑛
𝑥 = 𝑥0 + 𝑙 𝑝𝑔𝑐𝑑(𝑎,𝑛) , 𝑙 ∈ ℤ 𝑥0

𝑝𝑔𝑐𝑑(𝑎, 𝑛)

𝑥∈ℤ 𝑎𝑥 ≡ 𝑏 (𝑚𝑜𝑑 𝑛)

⇔ ∃𝑘 ∈ ℤ, 𝑎𝑥 = 𝑏 + 𝑘𝑛

⇔ ∃𝑘 ∈ ℤ, 𝑎𝑥 − 𝑘𝑛 = 𝑏

⇔ 𝑝𝑔𝑐𝑑(𝑎, 𝑛)|𝑏
𝑑 = 𝑝𝑔𝑐𝑑(𝑎, 𝑛) 𝑎 = 𝑑𝑎′ , 𝑛 =
𝑑𝑛′ 𝑏 = 𝑑𝑏 𝑑|𝑏 𝑎𝑥 − 𝑘𝑛 = 𝑏 𝑥, 𝑘 ∈ ℤ

𝑎′𝑥 − 𝑘𝑛′ = 𝑏′ (∗)

(𝑥0 , 𝑘0 ) (∗)
(𝑥, 𝑘) 𝑥 = 𝑥0 + 𝑙𝑛′ 𝑙∈ℤ 𝑘
𝑛
𝑥∈ℤ 𝑥 = 𝑥0 + 𝑙 𝑝𝑔𝑐𝑑(𝑎,𝑛) , 𝑙 ∈ ℤ 𝑥0

𝑎𝑥 ≡ 𝑏 (𝑚𝑜𝑑 𝑛) 𝑛 𝑝𝑔𝑐𝑑(𝑎, 𝑛)
∎

9𝑥 ≡ 6 (𝑚𝑜𝑑 24)
𝑝𝑔𝑐𝑑(9,24) = 3 6
𝑥 9𝑥 ≡ 6 (𝑚𝑜𝑑 24) 𝑥 𝑘 9𝑥 = 6 + 24𝑘
9𝑥 − 24𝑘 = 6
𝑝𝑔𝑐𝑑(9,24) = 3 6

3𝑥 − 8𝑘 = 2.
𝑝𝑔𝑐𝑑
𝑥0 = 6, 𝑘0 = 2
 Fermat
(𝑥, 𝑘) 3𝑥 − 8𝑘 = 2.
3(𝑥 − 𝑥0 ) − 8(𝑘 − 𝑘0 ) = 0 𝑥 = 𝑥0 + 8𝑙 𝑙∈ℤ
𝑘 𝑥
3𝑥 − 8𝑘 = 2 9𝑥 − 24𝑘 = 6 9𝑥 ≡ 6 (𝑚𝑜𝑑 24)
𝑥 = 6 + 8𝑙 3 24
𝑥1 = 6 + 24𝑚, 𝑥2 = 14 + 24𝑚, 𝑥3 = 22 + 24𝑚 𝑎𝑣𝑒𝑐 𝑚 ∈ ℤ.
∎

9𝑥 ≡ 6 (𝑚𝑜𝑑 24)
9, 𝑥, 6
𝑚𝑜𝑑𝑢𝑙𝑜 24 9𝑥 = 6

𝑥1 = 6, 𝑥2 = 14, 𝑥3 = 22.

𝑝 𝑎∈ℤ
𝑎𝑝 ≡ 𝑎 (𝑚𝑜𝑑 𝑝)

𝑝 𝑎, 𝑎 ∈ ℤ
𝑎𝑝−1 ≡ 1 (𝑚𝑜𝑑 𝑝)

𝑝 𝐶𝑝𝑘 1≤𝑘 ≤𝑝−1 𝐶𝑝𝑘 ≡ 0 (𝑚𝑜𝑑 𝑝)

𝑝!
𝐶𝑝𝑘 = 𝑘!(𝑝−𝑘)! 𝑝! = 𝑘! (𝑝 − 𝑘)! 𝐶𝑝𝑘 𝑝|𝑘! (𝑝 − 𝑘)! 𝐶𝑝𝑘 1≤𝑘 ≤𝑝−1
𝑝 𝑘! 𝑝 𝑘! < 𝑝 𝑝
(𝑝 − 𝑘)! 𝑝 𝐶𝑝𝑘

𝑎≥0
𝑎=0 0 ≡ 0 (𝑚𝑜𝑑 𝑝)
𝑎≥0 𝑎𝑝 ≡ 𝑎 (𝑚𝑜𝑑 𝑝) (𝑎 + 1)𝑝

(𝑎 + 1)𝑝 = 𝑎𝑝 + 𝐶𝑝𝑝−1 𝑎𝑝−1 + 𝐶𝑝𝑝−2 𝑎𝑝−2 + ⋯ + 𝐶𝑝1 𝑎 + 1

𝑝
 codage
𝑝
(𝑎 + 1) ≡ 𝑎 + 𝐶𝑝𝑝−1 𝑎𝑝−1 + 𝐶𝑝𝑝−2 𝑎𝑝−2 + ⋯ + 𝐶𝑝1 𝑎 + 1 (𝑚𝑜𝑑 𝑝)
𝑝

≡ 𝑎𝑝 + 1 (𝑚𝑜𝑑 𝑝)
≡ 𝑎 + 1 (𝑚𝑜𝑑 𝑝)
𝑎≥0
𝑎≤0
∎

143141 (𝑚𝑜𝑑 17) 17

16
14 ≡ 1 (𝑚𝑜𝑑 17) 3141 16
3141 = 16 × 196 + 5.

143141 ≡ 1416×196+5 ≡ 1416×196 × 145 ≡ (1)196 × 145 ≡ 145 (𝑚𝑜𝑑 17)

145 17 14 ≡ −3 (𝑚𝑜𝑑 17)
142 ≡ (−3)2 ≡ 9 (𝑚𝑜𝑑 17) 143 ≡ 142 × 14 ≡ 9 × (−3) ≡ −27 ≡ 7 (𝑚𝑜𝑑 17) 145 ≡ 142 ×
143 ≡ 9 × 7 ≡ 63 ≡ 12 (𝑚𝑜𝑑 17)
143141 ≡ 12 (𝑚𝑜𝑑 17)

𝑝 𝑞 𝑛 = 𝑝𝑞 𝑛

𝑝 𝑞 𝑛 = 𝑝𝑞 𝑎 ∈ ℤ
𝑝𝑔𝑐𝑑(𝑎, 𝑛) = 1
𝑎 (𝑝−1)(𝑞−1) ≡ 1 (𝑚𝑜𝑑 𝑛)
 𝒏
𝜑(𝑛) = (𝑝 − 1)(𝑞 − 1) 𝑝𝑔𝑐𝑑(𝑎, 𝑛) = 1
𝑎 𝑝 𝑞 𝑝 = 5, 𝑞 = 7, 𝑛 = 35 𝜑(𝑛) = 4 ·
6 = 24
𝑎 = 1,2,3,4,6,8,9,11,12,13,16,17,18, . .. 𝑎24 ≡ 1 (𝑚𝑜𝑑 35).

c = 𝑎 (𝑝−1)(𝑞−1) 𝑐 𝑝
(𝑞−1)
c ≡ 𝑎(𝑝−1)(𝑞−1) ≡ (𝑎(𝑝−1) ) ≡ 1(𝑞−1) ≡ 1 (𝑚𝑜𝑑 𝑝)
𝑎(𝑝−1) ≡ 1(𝑚𝑜𝑑 𝑝) 𝑝 𝑎
𝑐 𝑞
(𝑝−1)
c ≡ 𝑎(𝑝−1)(𝑞−1) ≡ (𝑎(𝑞−1) ) ≡ 1(𝑝−1) ≡ 1 (𝑚𝑜𝑑 𝑞)
𝑎(𝑞−1) ≡ 1(𝑚𝑜𝑑 𝑞) 𝑞 𝑎
𝑐 ≡ 1 (𝑚𝑜𝑑 𝑝𝑞)
𝑐 ≡ 1 (𝑚𝑜𝑑 𝑝) 𝛼∈ℤ 𝑐 = 1 + 𝛼𝑝 𝑐 ≡ 1 (𝑚𝑜𝑑 𝑞)
𝛽∈ℤ 𝑐 = 1 + 𝛽𝑞 𝑐 − 1 = 𝛼𝑝 = 𝛽𝑞 𝛼𝑝 = 𝛽𝑞 𝑝|𝛽𝑞
𝑝 𝑞
𝑝|𝛽 𝛽′ ∈ ℤ 𝛽 = 𝛽′𝑝
𝑐 = 1 + 𝛽𝑞 = 1 + 𝛽′𝑝𝑞 𝑐 ≡ 1 (𝑚𝑜𝑑 𝑝𝑞) 𝑎(𝑝−1)(𝑞−1) ≡
1 (𝑚𝑜𝑑 𝑛)
∎

𝒏
𝑎∈ℤ 𝑥∈ℤ 𝑎 𝑛 𝑎𝑥 ≡ 1 (𝑚𝑜𝑑 𝑛)
𝑎 𝑛 𝑎𝑥 ≡ 𝑏 (𝑚𝑜𝑑 𝑛)

 𝑎 𝑛 𝑎 𝑛
 𝑎𝑢 + 𝑛𝑣 = 1 𝑢 𝑎 𝑛
𝑎 𝑛
(𝑎, 𝑛)

𝑝𝑔𝑐𝑑(𝑎, 𝑛) = 1 ⇔ ∃𝑢, 𝑣 ∈ ℤ 𝑎𝑢 + 𝑛𝑣 = 1

⇔ ∃𝑢 ∈ ℤ 𝑎𝑢 ≡ 1 (𝑚𝑜𝑑 𝑛)
∎
 𝑛
𝑎𝑘 𝑛

511 (𝑚𝑜𝑑 14) 5, 52 , 54 , 58 . ..

𝑛 11 = 8 + 2 + 1
511 = 58 × 52 × 51 .
𝑖
52 (𝑚𝑜𝑑 14) 𝑖 = 0,1,2,3
5 ≡ 5 (𝑚𝑜𝑑 14)
52 ≡ 25 ≡ 11 (𝑚𝑜𝑑 14)
54 ≡ 52 × 52 ≡ 11 × 11 ≡ 121 ≡ 9(𝑚𝑜𝑑 14)
58 ≡ 54 × 54 ≡ 9 × 9 ≡ 81 ≡ 11(𝑚𝑜𝑑 14)

511 ≡ 58 × 52 × 51 ≡ 11 × 11 × 5 ≡ 11 × 55 ≡ 11 × 13 ≡ 143 ≡ 3 (𝑚𝑜𝑑 14) .

511 (𝑚𝑜𝑑 14) 5 10 5×
5×5 ···

17154 (𝑚𝑜𝑑 100) 𝑘 = 154 2

154 = 128 + 16 + 8 + 2 = 27 + 24 + 23 + 21
17, 172 , 174 , 178 , . . . , 17128 100
17 ≡ 17 (𝑚𝑜𝑑 100)
172 ≡ 17 × 17 ≡ 289 ≡ 89 (𝑚𝑜𝑑 100)
4 2 2 (𝑚𝑜𝑑 100)
17 ≡ 17 × 17 ≡ 89 × 89 ≡ 7921 ≡ 21
178 ≡ 174 × 174 ≡ 21 × 21 ≡ 441 ≡ 41 (𝑚𝑜𝑑 100)
1716 ≡ 178 × 178 ≡ 41 × 41 ≡ 1681 ≡ 81 (𝑚𝑜𝑑 100)
32 16 16
17 ≡ 17 ≡ 81 × 81 ≡ 6561 ≡ 61 (𝑚𝑜𝑑 100)
× 17
1764 ≡ 1732 × 1732 ≡ 61 × 61 ≡ 3721 ≡ 21 (𝑚𝑜𝑑 100)
17128 ≡ 1764 × 1764 ≡ 21 × 21 ≡ 441 ≡ 41 (𝑚𝑜𝑑 100)

17154 ≡ 17128 × 1716 × 178 × 172 ≡ 41 × 81 × 41 × 89 ≡ 3321 × 3649 ≡ 21 × 49 ≡ 1029

≡ 29(𝑚𝑜𝑑 100)
 𝑝 𝑞 𝑛 =𝑝×𝑞
𝑛 𝑝 𝑞

 𝑛


 𝑝 𝑞

 𝑛=𝑝×𝑞
 𝜑(𝑛) = (𝑝 − 1) × (𝑞 − 1)

 𝑝 = 5 𝑞 = 17
 𝑛 = 𝑝 × 𝑞 = 85
 𝜑(𝑛) = (𝑝 − 1) × (𝑞 − 1) = 64
𝜑(𝑛) 𝑛 𝑝× 𝑞
𝜑(𝑛) 𝑛

 𝑝 = 101 𝑞 = 103
 𝑛 = 𝑝 × 𝑞 = 10403
 𝜑(𝑛) = (𝑝 − 1) × (𝑞 − 1) = 10200

 𝑒 𝑝𝑔𝑐𝑑(𝑒, 𝜑(𝑛)) = 1
 𝑑 𝑒 𝜑(𝑛) ∶ 𝑑 × 𝑒 ≡ 1 (𝑚𝑜𝑑 𝜑(𝑛) )
 e = 5 pgcd(e, φ(n)) = pgcd(5,64) = 1

𝑝𝑔𝑐𝑑(𝑒, 𝜑(𝑛)) = 1 5 × 13 + 64 × (−1) = 1 5 × 13 ≡
1 (𝑚𝑜𝑑 64) 𝑒 𝜑(𝑛) 𝑑 = 13

 𝑒=7 𝑝𝑔𝑐𝑑(𝑒, 𝜑(𝑛)) = 𝑝𝑔𝑐𝑑(7,10200) = 1

 𝑝𝑔𝑐𝑑(𝑒, 𝜑(𝑛)) = 1 7(−1457) + 10200 × 1 = 1
−1457 ≡ 8743 (𝑚𝑜𝑑 𝜑(𝑛)) 𝑑 = 8743 𝑑 × 𝑒 ≡ 1 (𝑚𝑜𝑑 𝜑(𝑛))

𝑛 𝑒

𝑛 = 85 𝑒 = 5
𝑛 = 10403 𝑒 = 7

𝑑
𝑝, 𝑞 𝜑(𝑛)

𝑑 = 13
𝑑 = 8743

𝑚 0≤𝑚<𝑛

𝑚 = 10
𝑚 = 1234

𝑛 𝑒

𝑥 ≡ 𝑚𝑒 (𝑚𝑜𝑑 𝑛)
 𝑥

𝑚 = 10 𝑛 = 85 𝑒=5
𝑥 ≡ 𝑚𝑒 (𝑚𝑜𝑑 𝑛) ≡ 105 (𝑚𝑜𝑑 85)

102 ≡ 100 ≡ 15 (𝑚𝑜𝑑 85)

104 ≡ (102 )2 ≡ 152 ≡ 225 ≡ 55 (𝑚𝑜𝑑 85)
𝑥 5 4
≡ 10 ≡ 10 × 10 ≡ 55 × 10 ≡ 550 ≡ 40 (𝑚𝑜𝑑 85)
𝑥 = 40
𝑚 = 1234 𝑛 = 10403 𝑒=7
𝑥 ≡ 𝑚𝑒 (𝑚𝑜𝑑 𝑛) ≡ 12347 (𝑚𝑜𝑑 10403)

𝑥 = 10378

𝑥 𝑑

𝑚 ≡ 𝑥 𝑑 (𝑚𝑜𝑑 𝑛)

𝑐 = 40 𝑑 = 13 𝑛 = 85
𝑥 𝑑 ≡ 4013 (𝑚𝑜𝑑 85)
4013 85 13 = 8 + 4 + 1 4013 = 408 × 404 × 401
402 ≡ 1600 ≡ 70 (𝑚𝑜𝑑 85)
4 2 2 2
40 ≡ (40 ) ≡ 70 ≡ 4900 ≡ 55 (𝑚𝑜𝑑 85)
408 ≡ (404 )2 ≡ 552 ≡ 3025 ≡ 50 (𝑚𝑜𝑑 85)

𝑥 ≡ 4013 ≡ 408 × 404 × 40 ≡ 50 × 55 × 40 ≡ 10 (𝑚𝑜𝑑 85)

𝑚
𝑐 = 10378, 𝑑 = 8743, 𝑛 = 10403 𝑥 ≡ 103788743 (𝑚𝑜𝑑 10403)
𝑚 = 1234
 4.

 𝑛, 𝑒
 𝑑

5.

𝑑 𝑒 𝜑(𝑛)
𝑥 ≡ 𝑚𝑒 (𝑚𝑜𝑑 𝑛) 𝑚 ≡ 𝑥 𝑑 (𝑚𝑜𝑑 𝑛)
𝑚
(𝑒, 𝑛) 𝑥 𝑑

 𝑑 𝑒 𝜑(𝑛) 𝑑 · 𝑒 ≡ 1 (𝑚𝑜𝑑 𝜑(𝑛))

𝑘 ∈ ℤ 𝑑 · 𝑒 = 1 + 𝑘 · 𝜑(𝑛)
 𝑚 𝑛
𝑚𝜑(𝑛) ≡ 𝑚(𝑝−1)(𝑞−1) ≡ 1 (𝑚𝑜𝑑 𝑛)
𝑝𝑔𝑐𝑑(𝑚, 𝑛) = 1
𝑥 ≡ 𝑚𝑒 (𝑚𝑜𝑑 𝑛) 𝑥𝑑 :
𝑥 𝑑 ≡ (𝑚𝑒 )𝑑 ≡ 𝑚𝑒.𝑑 ≡ 𝑚1+ 𝑘·𝜑(𝑛) ≡ 𝑚. 𝑚 𝑘·𝜑(𝑛) ≡ 𝑚. (𝑚 𝜑(𝑛) )𝑘 ≡ 𝑚. (1)𝑘 ≡ 𝑚 (𝑚𝑜𝑑 𝑛)
𝑝𝑔𝑐𝑑(𝑚, 𝑛) ≠ 1
𝑛 𝑝 𝑞 𝑚 𝑛
𝑚 𝑛 𝑝 𝑚 𝑞 𝑚
𝑝𝑔𝑐𝑑(𝑚, 𝑛) = 𝑝 𝑝𝑔𝑐𝑑(𝑚, 𝑞) = 1
𝑝𝑔𝑐𝑑(𝑚, 𝑛) = 𝑞 𝑝𝑔𝑐𝑑(𝑚, 𝑝) = 1
(𝑚𝑒 )𝑑 𝑝 𝑞

𝑝 𝑚 ≡ 0 (𝑚𝑜𝑑 𝑝) (𝑚𝑒 )𝑑 ≡ 0 (𝑚𝑜𝑑 𝑝) (𝑚𝑒 )𝑑 ≡ 𝑚 (𝑚𝑜𝑑 𝑝)

 𝑞 (𝑚𝑒 )𝑑 ≡ 𝑚 × (𝑚 𝜑(𝑛) )𝑘 ≡ 𝑚 × (𝑚 (𝑞−1) )(𝑝−1)𝑘 ≡ 𝑚 (𝑚𝑜𝑑 𝑞)
𝑝 𝑞

(𝑚𝑒 )𝑑 ≡ 𝑚 (𝑚𝑜𝑑 𝑛).

∎

𝑝 = 29, 𝑞 = 37
𝑛 = 𝑝𝑞 = 29 × 37 = 1073
𝜑(𝑛) = (𝑝 − 1) × (𝑞 − 1) = (29 − 1) × (37 − 1) = 1008
𝑒 𝜑(𝑛) 𝑝 𝑞
𝜑(𝑛) ⇒ 𝑒 = 73

𝑑 𝑒 × 𝑑 (𝑚𝑜𝑑 𝜑(𝑛)) = 1 ⇒ 73 × 𝑑 (𝑚𝑜𝑑 1008) = 1 ⇒ 𝑑 = 649

 (73,1073)
 (649,1073)

"𝐻𝑒𝑙𝑙𝑜 𝑤𝑜𝑟𝑙𝑑! " 𝐴𝑆𝐶𝐼𝐼1

𝑅𝑆𝐴 7 𝑏𝑖𝑡𝑠
𝐴𝑆𝐶𝐼𝐼
𝐻 7 𝑏𝑖𝑡𝑠 = (1001000)2 = (72)10
72, 101, 108, 108, 111, 32, 119, 111, 114, 108, 100, 33
𝑥 ≡ 𝑚𝑒 (𝑚𝑜𝑑 𝑛) (𝑒, 𝑛)
(73,1073)
 7273 (𝑚𝑜𝑑 1073) = 997
 10173 (𝑚𝑜𝑑 1073) = 1026
 10873 (𝑚𝑜𝑑 1073) = 367
 10873 (𝑚𝑜𝑑 1073) = 367
 11173 (𝑚𝑜𝑑 1073) = 629
 3273 (𝑚𝑜𝑑 1073) = 698
  11973 (𝑚𝑜𝑑 1073) = 785
 11173 (𝑚𝑜𝑑 1073) = 629
 11473 (𝑚𝑜𝑑 1073) = 965
 10873 (𝑚𝑜𝑑 1073) = 367
 10073 (𝑚𝑜𝑑 1073) = 544
 3373 (𝑚𝑜𝑑 1073) = 847
997 1026 367 367 629 698 785 629 965 367 544 847

997 1026 367 367 629 698 785 629 965 367 544 847.
𝑚 = 𝑥 𝑑 (𝑚𝑜𝑑 𝑛) (𝑑, 𝑛)
(649,1073)

 997649 (𝑚𝑜𝑑 1073) = 72

 1026649 (𝑚𝑜𝑑 1073) = 101
 367649 (𝑚𝑜𝑑 1073) = 108
 367649 (𝑚𝑜𝑑 1073) = 108
 629649 (𝑚𝑜𝑑 1073) = 111
 698649 (𝑚𝑜𝑑 1073) = 32
 785649 (𝑚𝑜𝑑 1073) = 119
 629649 (𝑚𝑜𝑑 1073) = 111
 965649 (𝑚𝑜𝑑 1073) = 114
 367649 (𝑚𝑜𝑑 1073) = 108
 544649 (𝑚𝑜𝑑 1073) = 100
 847649 (𝑚𝑜𝑑 1073) = 33
𝐴𝑆𝐶𝐼𝐼 72, 101, 108, 108, 111, 32, 119, 111, 114, 108, 100, 33 "𝐻𝑒𝑙𝑙𝑜 𝑤𝑜𝑟𝑙𝑑! "

𝑨𝑺𝑪𝑰𝑰: