Exit Zen
77
../../principles/security.rst:893
English
Let us first explore how this could be realized by using public-key cryptography. We assume that Alice and Bob have both a public-private key pair and the corresponding certificates signed by a trusted third party : Ted.
0/2200 · 220
78
../../principles/security.rst:898
English
A possible protocol would be the following. Alice sends :math:`Cert(Alice_{pub},Ted)`. This certificate provides Alice's identity and her public key. Bob replies with the certificate containing his own public key : :math:`Cert(Bob_{pub},Ted)`. At this point, they both know the other public key and could use it to send encrypted messages. Alice would send :math:`E_p(Bob_{pub},M1)` and Bob would send :math:`E_p(Alice_{pub},M2)`. In practice, using public key encryption techniques to encrypt a large number of messages is inefficient because these cryptosystems require a large number of computations. It is more efficient to use secret key cryptosystems for most of the data and only use a public key cryptosystem to encrypt the random secret keys that will be used by the secret key encryption scheme.
0/8050 · 805
79
../../principles/security.rst:913
English
Key exchange
0/120 · 12
80
../../principles/security.rst:920
English
When users want to communicate securely through a network, they need to exchange information such as the keys that will be used by an encryption algorithm even in the presence of an eavesdropper. The most widely used algorithm that allows two users to safely exchange an integer in the presence of an eavesdropper is the one proposed by Diffie and Hellman [DH1976]_. It operates with (large) integers. Two of them are public, the modulus, p, which is prime and the base, g, which must be a primitive root of p. The communicating users select a random integer, :math:`a` for Alice and :math:`b` for Bob. The exchange starts as :
0/6270 · 627
81
../../principles/security.rst:931
English
Alice selects a random integer, :math:`a` and sends :math:`A=g^{a} \mod p` to Bob
0/810 · 81
82
../../principles/security.rst:933
English
Bob selects a random integer, :math:`b` and sends :math:`B=g^{b} \mod p` to Alice
0/810 · 81
83
../../principles/security.rst:935
English
From her knowledge of :math:`a` and :math:`B`, Alice can compute :math:`Secret=B^{a} \mod p= (g^{b} \mod p) ^{a} \mod p=g^{a \times b} \mod p`
0/1420 · 142
84
../../principles/security.rst:937
English
From is knowledge of :math:`b` and :math:`A`, Bob can compute :math:`Secret=A^{b} \mod p=(g^{a} \mod p) ^{b} \mod p=g^{a \times b} \mod p`
0/1380 · 138
85
../../principles/security.rst:940
English
The security of this protocol relies on the difficulty of computing discrete logarithms, i.e. from the knowledge of :math:`A` (resp. :math:`B`), it is very difficult to extract :math:`\log(A)=\log(g^{a} \mod p)=a` (resp. :math:`\log(B)=\log(g^{b} \mod p)=b`).
0/2590 · 259
86
../../principles/security.rst:945
English
An example of the utilization of the Diffie-Hellman key exchange is shown below. Before starting the exchange, Alice and Bob agree on a modulus (:math:`p=23`) and a base (:math:`g=5`). These two numbers are public. They are typically part of the standard that defines the protocol that uses the key exchange.
0/3080 · 308
87
../../principles/security.rst:951
English
Alice chooses a secret integer : :math:`a=8` and sends :math:`A= g^{a} \mod p= 5^{8} \mod 23=16` to Bob
0/1030 · 103
88
../../principles/security.rst:953
English
Bob chooses a secret integer : :math:`b=13` and sends :math:`B= g^{b} \mod p=5^{13} \mod 23=21` to Alice
0/1040 · 104
89
../../principles/security.rst:955
English
Alice computes :math:`S_{A}=B^{a} \mod p= 21^{8} \mod 23=3`
0/590 · 59
90
../../principles/security.rst:956
English
Bob computes :math:`S_{B}=A^{b} \mod p= 16^{13} \mod 23=3`
0/580 · 58
91
../../principles/security.rst:958
English
Alice and Bob have agreed on the secret information :math:`3` without having sent it explicitly through the network. If the integers used are large enough and have good properties, then even Eve who can capture all the messages sent by Alice and Bob cannot recover the secret key that they have exchanged. There is no formal proof of the security of the algorithm, but mathematicians have tried to solve similar problems with integers during centuries without finding an efficient algorithm. As long as the integers that are used are random and large enough, the only possible attack for Eve is to test all possible integers that could have been chosen by Alice and Bob. This is computationally very expensive. This algorithm is widely used in security protocols to agree on a secret key.
0/7880 · 788
92
../../principles/security.rst:970
English
Unfortunately, the Diffie-Hellman key exchange alone cannot cope with man-in-the middle attacks. Consider Mallory who sits in the middle between Alice and Bob and can easily capture and modify their messages. The modulus and the base are public. They are thus known by Mallory as well. He could then operate as follows :
0/3200 · 320
93
../../principles/security.rst:976
English
Alice chooses a secret integer and sends :math:`A= g^{a} \mod p` to Mallory
0/750 · 75
94
../../principles/security.rst:977
English
Mallory generates a secret integer, :math:`m` and sends :math:`M=g^{m} \mod p` to Bob
0/850 · 85
95
../../principles/security.rst:978
English
Bob chooses a secret integer and sends :math:`B=g^{b} \mod p` to Mallory
0/720 · 72
96
../../principles/security.rst:979
English
Mallory computes :math:`S_{A}=A^{m} \mod p` and :math:`S_{B}=B^{m} \mod p`
0/740 · 74