Study and Analysis of Hard Problem in Elliptic Curve Cryptography

Main Article Content

Amita Rathee


Hard Problems are the problems infeasible to solve in some sense. In cryptography the difficulty deals with computational requirements in finding solution. In this paper we will discuss how hard problems are base of cryptography. We are going to study the hard problems in Elliptic Curve Cryptography. What we going to discuss is which hard problem makes Elliptic Curve Cryptography more infeasible to break in the existing hard problems. Most suitable hard problem for Elliptic Curve Cryptography is Elliptic Curve Discrete Logarithm Problem.


Keywords: Hard Problem, Elliptic Curve Cryptography, Elliptic Curve Discrete Logarithm Problem, P Class, NP Class.


Download data is not yet available.

Article Details