Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a...
Transcript of Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a...
![Page 1: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/1.jpg)
Diffie-Hellman cryptographic method
Shared secret key
A B
— 227 —
![Page 2: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/2.jpg)
Diffie-Hellman cryptographic method
Shared secret key
A
a
c, pB
b
— 227-a —
![Page 3: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/3.jpg)
Diffie-Hellman cryptographic method
Shared secret key
A
a
[ca]p = α
c, pB
b
β = [cb]p
— 227-b —
![Page 4: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/4.jpg)
Diffie-Hellman cryptographic method
Shared secret key
A
a
[ca]p = α
β
c, pB
b
β = [cb]p
α
��������α
��◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗ ��������β
��♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠
— 227-c —
![Page 5: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/5.jpg)
Diffie-Hellman cryptographic method
Shared secret key
A
a
[ca]p = α
β
k = [βa]p
c, pB
b
β = [cb]p
α
[αb]p = k
��������α
��◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗◗
◗◗◗ ��������β
��♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠♠
— 227-d —
![Page 6: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/6.jpg)
A B
— 126 —
Key Exchange
![Page 7: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/7.jpg)
A B
— 126 —
Key Exchange
![Page 8: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/8.jpg)
A B
— 126 —
Key Exchange
![Page 9: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/9.jpg)
A B
— 126 —
Key Exchange
![Page 10: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/10.jpg)
A B
— 126 —
Key Exchange
![Page 11: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/11.jpg)
A B
— 126 —
Key Exchange
![Page 12: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/12.jpg)
A B
— 126 —
Key Exchange
![Page 13: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/13.jpg)
A B
— 126 —
Key Exchange
![Page 14: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/14.jpg)
Key exchange
Lemma 75 Let p be a prime and e a positive integer with
gcd(p− 1, e) = 1. Define
d =�
lc2(p− 1, e)�
p−1.
Then, for all integers k,
(ke)d ≡ k (mod p) .
PROOF:
— 228 —
![Page 15: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/15.jpg)
![Page 16: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/16.jpg)
![Page 17: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/17.jpg)
A B
— 230 —
![Page 18: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/18.jpg)
A
(eA, dA)
0 ≤ k < p
p
B
(eB, dB)
— 230-a —
![Page 19: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/19.jpg)
A
(eA, dA)
0 ≤ k < p
[keA ]p = m1
p
B
(eB, dB)
m1
��������m1��
— 230-b —
![Page 20: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/20.jpg)
A
(eA, dA)
0 ≤ k < p
[keA ]p = m1
m2
p
B
(eB, dB)
m1
m2 = [m1eB]p
��������m1��
��������m2��
— 230-c —
![Page 21: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/21.jpg)
A
(eA, dA)
0 ≤ k < p
[keA ]p = m1
m2
[m2dA]p = m3
p
B
(eB, dB)
m1
m2 = [m1eB]p
m3
��������m1��
��������m2��
��������m3��
— 230-d —
![Page 22: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/22.jpg)
A
(eA, dA)
0 ≤ k < p
[keA ]p = m1
m2
[m2dA]p = m3
p
B
(eB, dB)
m1
m2 = [m1eB]p
m3
[m3dB]p = k
��������m1��
��������m2��
��������m3��
— 230-e —
![Page 23: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/23.jpg)
Natural Numbersand mathematical induction
We have mentioned in passing that the natural numbers are
generated from zero by succesive increments. This is in fact the
defining property of the set of natural numbers, and endows it with
a very important and powerful reasoning principle, that of
Mathematical Induction, for establishing universal properties of
natural numbers.
— 231 —
![Page 24: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/24.jpg)
Principle of Induction
Let P(m) be a statement for m ranging over the set of natural
numbers N.
If
◮ the statement P(0) holds, and
◮ the statement
∀n ∈ N.�
P(n) =⇒ P(n+ 1)�
also holds
then
◮ the statement
∀m ∈ N. P(m)
holds.
— 232 —
![Page 25: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/25.jpg)
Binomial Theorem
Theorem 29 For all n ∈ N,
(x+ y)n =Pn
k=0
�
nk
�
· xn−k · yk .
PROOF:
— 237 —
![Page 26: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/26.jpg)
![Page 27: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/27.jpg)
![Page 28: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/28.jpg)
Principle of Inductionfrom basis ℓ
Let P(m) be a statement for m ranging over the natural
numbers greater than or equal a fixed natural number ℓ.
If
◮ P(ℓ) holds, and
◮ ∀n ≥ ℓ in N.�
P(n) =⇒ P(n+ 1)�
also holds
then
◮ ∀m ≥ ℓ in N. P(m) holds.
— 251 —
![Page 29: Diffie Hel lman cryptographic method · Diffie-Hel lman cryptographic method Shared secret key A a [ca] p =α β c,p B b β = [cb] p α α β ♠♠♠ ♠ ♠♠♠♠♠ ♠♠♠♠♠](https://reader036.fdocuments.net/reader036/viewer/2022062610/61108cbba508d235cf63d97b/html5/thumbnails/29.jpg)
Principle of Strong Induction
from basis ℓ and Induction Hypothesis P(m).
Let P(m) be a statement for m ranging over the natural
numbers greater than or equal a fixed natural number ℓ.
If both
◮ P(ℓ) and
◮ ∀n ≥ ℓ in N.�
�
∀k ∈ [ℓ..n]. P(k)�
=⇒ P(n+ 1)�
hold, then
◮ ∀m ≥ ℓ in N. P(m) holds.
— 255 —