The translation has come to an end.
Exit Zen
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
97
../../principles/security.rst:980
English
Alice computes :math:`S_{A}=M^{a} \mod p` and uses this key to communicate with Mallory (acting as Bob)
0/1030 · 103
98
../../principles/security.rst:981
English
Bob computes :math:`S_{B}=M^{b} \mod p` and uses this key to communicate with Mallory (acting as Alice)
0/1030 · 103
99
../../principles/security.rst:983
English
When Alice sends a message, she encrypts it with :math:`S_{A}`. Mallory decrypts it with :math:`S_{A}` and encrypts the plaintext with :math:`S_{B}`. When Bob receives the message, he can decrypt it by using :math:`S_{B}`.
0/2220 · 222
100
../../principles/security.rst:988
English
To safely use the Diffie-Hellman key exchange, Alice and Bob must use an `authenticated` exchange. Some of the information sent by Alice or Bob must be signed with a public key known by the other user. In practice, it is often important for Alice to authenticate Bob. If Bob has a certificated signed by Ted, the authenticated key exchange could be organized as follows.
0/3700 · 370
101
../../principles/security.rst:995
English
Alice chooses a secret integer : :math:`a` and sends :math:`A= g^{a} \mod p` to Bob
0/830 · 83
102
../../principles/security.rst:997
English
Bob chooses a secret integer : :math:`b`, computes :math:`B= g^{b} \mod p` and sends :math:`Cert(Bob,Bob_{pub},Ted), E_p(Bob_{priv},B)` to Alice
0/1440 · 144
103
../../principles/security.rst:1000
English
Alice checks the signature (with :math:`Bob_{pub}`) and the certificate and computes :math:`S_{A}=B^{a} \mod p`
0/1110 · 111
104
../../principles/security.rst:1002
English
Bob computes :math:`S_{B}=A^{b} \mod p`
0/390 · 39
105
../../principles/security.rst:1006
English
This prevents the attack mentioned above since Mallory cannot create a fake certificate and cannot sign a value by using Bob's private key. Given the risk of man-in-the-middle attacks, the Diffie-Hellman key exchange mechanism should never be used without authentication.
0/2710 · 271
107
../../principles/security.rst:1016
English
The wikipedia page on passwords provides many of these references : https://en.wikipedia.org/wiki/Password_strength
0/1150 · 115
108
../../principles/security.rst:1019
English
A detailed explanation of the operation of the RSA algorithm is outside the scope of this e-book. Various tutorials such as the `RSA page <https://en.wikipedia.org/wiki/RSA_(cryptosystem)>`_ on wikipedia provide examples and tutorial information.
0/2460 · 246
109
../../principles/security.rst:1024
English
A detailed explanation of the ECC cryptosystems is outside the scope of this e-book. A simple introduction may be found on `Andrea Corbellini's blog <http://andrea.corbellini.name/2015/05/17/elliptic-curve-cryptography-a-gentle-introduction/>`_. There have been deployments of ECC recently because ECC schemes usually require shorter keys than RSA and consume less CPU.
0/3690 · 369
The translation has come to an end.