Secured digital signature based on factor problem over non-commutative groups

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 GL _n (F_q), UT _n (F_q) and the Braid Groups. Finally we explained security analysis.