A Secured Digital Signature Using Conjugacy and DLP on Non-commutative Group over Finite Field

Abstract

In the present paper, we propose a secured scheme of digital signature connecting both conjugacy problem and discrete logarithm problem based on non-commutative group generated over a finite field. For this, we define a non-commutative group over matrices with the elements of finite field such that conjugacy and discrete logarithm problems can be executed together proficiently. By doing so, we can formulate the signature structures using conjugacy and discrete logarithm through non commutative group. In some domains, the above combination reduces to completely in discrete logarithm problem. This digital signature scheme more elemental over F* q(x) = G Ln (Fq). Here the security of the signature protocol depending on complexity of the problems associated with conjugacy and discrete logarithm. The security analysis and intermission of proposed protocol of digital signature is presented with the aid of order of complexity, existential forgery and signature repudiation.