The method and key exchange algorithm among groups of users based on asymmetric schemes: RSA and ECC

Abstract

The article presents a comparison of performance implementations of key exchange method Diffie-Hellmanna for many participants based on asymmetric codes ECC and RSA. This method allows a group of users to generate a common encryption key in unprotected communication channels, without the need of a centralized server. The article provided an example of the algorithm for each of these encryption schemes in the form of mathematical models and algorithms in the programming language C#. Also, a comparison of the rate of generation of asymmetric encryption keys and of common symmetric key for a different number of participants is given.