Algebraic signature algorithms with a hidden group group, based on hardness of solving systems of quadratic equations

A new-type algebraic digital signature schemes on non-commutative associative algebras are developed using technique of performing exponentiation operations in a hidden group. The signature contains two elements: a randomization integer e and a vector S. The used verification equations are characterized in multiple entries of the signature element S. The post-quantum security of the introduced signature algorithms is provided by the computational difficulty of solving a system of many quadratic equations in many variables, like in the public-key multivariate cryptosystems. However in the former case the quadratic equations are set over the finite fields having the order of significantly larger size.