Аналіз методів захисту інформації на основі перетворень в групі точок еліптичних кривих

Abstract

This paper covers relatively new and emerging subject of the elliptic curve crypto systems which fundamental security is based on the algorithmically hard discrete logarithm problem.It presents a comparative analysis of RSA and ECC. Cryptosystems based on elliptic curves emerge as an alternative to the RSA cryptosystems. The security of the RSA cryptosystem is based on the integer factorization problem (IFP) whereas the security of ECC is based on the EC discrete logarithm problem (ECDLP).The experimentation was conducted for finding time lapse during encryption, decryption by RSA and ECC. The conclusion contains a brief summary of the elliptic curve cryptosystem practical applications, the potential practical benefits and disadvantages of ECC