A NEW METHOD FOR CONSTRUCTING DIGITAL SIGNATURE SCHEME BASED ON NEW HARD PROBLEM

Tóm tắt

Research in the field of public key cryptography in general and digital signatures in particular is often considered and evaluated at two levels: The first level is considering the mathematical basis for constructing cryptographic and digital signature algorithms, especially these difficult problems: factorizing a large integer into prime factors, finding root problem, discrete logarithm problem, discrete logarithm problem on elliptic curve... The second level is constructing cryptographic and digital signatures algorithms on these hard problems including RSA, DSA, Schnorr, GOST R34.10-94. At the first level, research focuses mainly on improving algorithms for finding large primes, structures for strong primes and algorithms to attack these problems efficiently. At the second level, the research concentrates on improving the existing algorithms to enhance the safety or effective performance of the algorithm. In this article, the authors propose a solution to improve the security of digital signature schemes, implemented in both levels of digital signatures. At the first level, the authors propose a new hard problem - different from the hard problems used before and hasn’t been solved by anyone so far (except by "brute force attack" method). At the second level, the authors propose a method to construct new digital signature algorithms that can help create not only one but also a family of new digital signature algorithms with high security level for practical applications.Digital signature