Читать книгу Cryptography, Information Theory, and Error-Correction - Aiden A. Bruen - Страница 74
An example with a small prime
Оглавление, , , . Then:
The common secret key possessed by is 4. In calculating, we may use the shortcuts that were introduced earlier in Chapter 3.
The security of the Diffie–Hellman (DH) key‐exchange rests on the assumption that the DH problem described now cannot be solved in a reasonable amount of time, i.e. is intractable.
