A NEW DIGITAL SIGNATURE SCHEME BASED ON THE DIFFICULTY OF THE DISCRETE LOGARIT COMBINING FINDING ROOT PROBLEM ON ZP

120 views

Abstract

 The paper proposes to build a digital signature schema based on the difficulty of the discrete logarithm combining finding the root problem on Zp. This problem is a new difficult type of problems class without a mathematical solution. Building a digital signature scheme based on the difficulty of the discrete logarithm combining finding root problem allows improving the security of the algorithm. In addition, the signature schema construction method here can be applied to develop a new digital signature algorithm layer that is suitable for applications that require high levels of security in practice.