Abstract
For millennia, dozens of solutions, which sole purpose was to prevent outsiders from reading information, have been developed, refined and broken. This led to the emergence of two opposing fields - cryptography and cryptanalysis. In the age of computers, all existing solutions have been abandoned and new ones have been introduced, with the most secure ones RSA and ciphers based on elliptic curves. Both considered impossible to break. This result directly from the math used in their definitions. Some previous researches have already shown some of their weaknesses, but there is still no solution that would work in every single case. Because of this, it was decided to take a closer look at the weak points of elliptic ciphers, taking into account all the information available to date.
References
[2] D. Hankerson, A. Menezes, S. Vanstone, “Guide to Elliptic Curve Cryptography”, Springer, 2004
[3] E. Brier, M. Joye, “Weierstraß Elliptic Curves and Side-Channel Attacks”, Public Key Cryptography, vol. 2274 of Lecture Notes in Computer Science, pp. 335–345, Springer-Verlag, 2002
[4] M. Musson, “Attacking the Elliptic Curve Discrete Logarithm Problem”, Acadia University Master thesis, Spring Convocation, 2006