Method for proving the authenticity or integrity of a message by means of a public exponent equal to the power of two

摘要

The proof is provided by means of the following parameters: a public module n formed by the product of f prime factors p_i, f>2; a public superscript v; m base numbers g_i, m>1. The base numbers g_i are such that the two equations: x²≡g_i mod n and x²≡-g_i mod n cannot de solved in x in the ring of integers modulo n, and such that the equation x^v≡g_i² mod n can be solved in x in the ring of integers modulo n in the case where the public superscript v is in the form v=2^k, wherein k is a security parameter.