A digital signature method based on braid group adjoint problem

The invention discloses a plait group conjugate problem based digital signing method, by adding in random factor b, making conjugate cell of a conjugate pair (sing(m), h(m)) be b-1a with respect to each message m, therefore the conjugate cells at every turn are different, accordingly covering information leakage of a private key a, and avoiding the k-CSP problem in a SCSS signing system using the existing technique. On the premise of not reducing safety, it largely save calculating time and enhances efficiency.