Secured digital signature based on factor problem over non-commutative groups
V. Jalaja, G. S. G. N. Anjaneyulu · 2016
In this article, we design a secured digital signature based on properties of non-commutative group. The security of digital signature is based on the hardness of the Factor problem over non-commutative groups. We believe that the Factor problem over non-commutative groups is NP hard. To promote this towards implementation strongly, we will demonstrate the digital signature in singular groups like GLn(Fq), UTn(Fq) and the Braid Groups. Finally we explained security analysis.