A METHOD FOR CONSTRUCTING DIGITAL SIGNATURE SCHEMES BASED ON NEW HARD PROBLEM ON THE ELLIPTIC CURVE
Keywords:
Digital signature, digital signature scheme, discrete logarithm problem, elliptic curve discrete logarithm problem, elliptic curve cryptography
Abstract
In this paper, the authors propose a solution to improve the secure of digital signature schemes, this solution is implemented on two levels of digital signature scheme construction. At the first level, the authors propose a new hard problem, this hard problem belongs to the class of hard problems for which there is currently no solution (except by “brute force attack" method). At the second level, the authors propose a method to construct new digital signature algorithms based on this hard problem.