Public-key cryptography uses an encryption algorithm that is made by a mathematical formula. Elliptic Curve is one of the formulas. Why is the math problem used for this cryptography system?
Mathematical Formulas
Those math problems in an encryption area have a feature like this.
“Finding a result with inputs is easy, but finding the input(s) is not easy, almost impossible.”
For example, let’s assume that you are trying to solve a problem:
- Problem:
If , what is
value?
And next, what is the other value for
?
Easy? Then, if you didn’t know that when ,
at first, could you solve this problem nimbly? How about if
?
In these problems, finding value(s) with input
is always taking longer than finding
value with input
whether you are a genius or not. And, the computer is also! But, the example is so easy to the computer!
If so, how about a math problem has no inverting solution to find value? The final solution is assigning all number for
until finding presented
value. For instance, someone wants to find out my secret value
, and I made the secrete value from very large value like 9,223,372,036,854,775,807 = possible maximum value for
in binary system = 8 bytes in the computer using a mathmatical formula,
. Additionally, the computer spends 0.1 second to solve the
for every single value
. How long does it take to find out my secret value? At the very worst, it takes almost 29,247,120,867 years. So, it’s practically impossible!
In the world, there are a lot of unsolved problems. Elliptic curve is the one of that kind.