An Attempt towards the Analysis of Posteriori Time complexity of Elliptic Curve Cryptography Key Generations over Large Integers
Cryptography basically establishes secured communication between two parties. There are two types of network cryptographic methods namely, symmetric key cryptography and asymmetric key cryptography. If the same set of keys involved in both encryption and decryption, then it is said to be symmetric key cryptography. One of the well known and applied public key cryptosystems over the network field is Elliptic curve Cryptosystem (ECC). In general, ECC has a major advantage over the crypto attacks i.e. ECC is at least four times stronger than the RSA cryptosystem with respect to the exposure of private key. In this paper, the authors are implementing the ECC with its tuned parameters and comparing its security level with the existing system.