A digital signature scheme based on problem of solving polynomial congruence in residue class modulo n

Many digital signature schemes have been proposed based on different mathematical problems. Some of them are based on factoring into primes, discrete logarithm problem, elliptic curve discrete logarithm problem, lattice problem, multivariate quadratic problem etc. In this work a signature scheme is proposed which security is based on problem of solving polynomial congruence modulo some positive integer. In proposed scheme degree of polynomial is not fixed, so degree can be changed to increase security. It is also efficient because in all the phases modulo addition and multiplication are used and no need to calculate higher exponent.