Cryptographic algorithms are widely used to safeguard data and information over the internet. One of the most efficient technique used for this purpose is the Elliptic Curve Cryptosystem (ECC) which recently gained a lot of interest due to its high performance. It is based upon the hardness of Elliptic Curve Discrete Logarithmic Problem (ECDLP) and till date there is no efficient algorithm that can solve the problem in polynomial time. In this paper an innovative algorithm for ``Menezes-Vanstone Elliptic curve cryptosystem (MVECC)’’ have been proposed to make it more efficient. In comparison to the original algorithm, the proposed algorithm has no inverse operation making it faster and less computationally complex.