User avatar qdeconinck

Contributor joined
Contributor joined 4 years ago
User avatar gegoa

Changes committed
Changes committed 4 years ago
User avatar gegoa

Translation added
Alice and Bob
Alice et Bob
4 years ago
User avatar gegoa

Language added
French 4 years ago
User avatar gegoa

Changes committed
Changes committed 4 years ago
User avatar gegoa

Resource updated
The “locale/fr/LC_MESSAGES/principles/security.po” file was changed. 4 years ago
User avatar None

Source string added
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.
4 years ago
User avatar None

Source string added
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.
4 years ago
User avatar None

Source string added
The wikipedia page on passwords provides many of these references : https://en.wikipedia.org/wiki/Password_strength
4 years ago
User avatar None

Source string added
Footnotes
4 years ago
User avatar None

Source string added
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.
4 years ago
User avatar None

Source string added
Bob computes :math:`S_{B}=A^{b} \mod p`
4 years ago
User avatar None

Source string added
Alice checks the signature (with :math:`Bob_{pub}`) and the certificate and computes :math:`S_{A}=B^{a} \mod p`
4 years ago
User avatar None

Source string added
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
4 years ago
User avatar None

Source string added
Alice chooses a secret integer : :math:`a` and sends :math:`A= g^{a} \mod p` to Bob
4 years ago
User avatar None

Source string added
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.
4 years ago
User avatar None

Source string added
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}`.
4 years ago
User avatar None

Source string added
Bob computes :math:`S_{B}=M^{b} \mod p` and uses this key to communicate with Mallory (acting as Alice)
4 years ago
User avatar None

Source string added
Alice computes :math:`S_{A}=M^{a} \mod p` and uses this key to communicate with Mallory (acting as Bob)
4 years ago
User avatar None

Source string added
Mallory computes :math:`S_{A}=A^{m} \mod p` and :math:`S_{B}=B^{m} \mod p`
4 years ago

Search