350 rub
Journal Highly available systems №2 for 2012 г.
Article in number:
A new key agreement protocol based on DiffieHellman scheme
Authors:
A.Yu. Nesterenko
Abstract:
We present a new variant of Diffie-Hellman protocol, which is realized in a group of points of elliptic curve over finite field and contains a possibility of key confirmation. An important feature of this protocol is mutual authentication of protocol entities. We make some security demands to the protocol such as key security, long-term keys security, known key security, forward secrecy, key compromise impersonation, unknown key sharing and no key control. We show that our protocol are meets our expectations. We present defence methods and show that protocol compromising, based on eavesdropping and cryptoanalisys, isn't successful for the attacker. In addition, we show that many active attacks are unsuccessful too.
Pages: 81-90
References
  1. Нестеренко А.Ю. Алгоритмы поиска длин циклов в последовательностях и их приложения // Фундаментальная и прикладная математика. Т. 16. 2010. С. 109-122.
  2. Черемушкин А.В. Криптографические протоколы. Основные свойства и уязвимости. 2007.
  3. Abadi M., Needham R. Prudent Engeeniring Practice For Cryptographic Protocols. 1994.
  4. Boyd C., Mathuria A. Protocols For Authentification And Key Establishment. 2003.
  5. OpenSSL:The Open Source toolkit for SSL/TLS. - http://openssl.org.