Cryptography, Cybersecurity, Cryptocurrency.
c=H(g,X,A) and then computes z=a+c.x, and sends A and z. The verifier can then recompute c, and prove that g^z is equal to A.X^c. This is because: A.X^c = g^a (g^x)^c = g^a . g ^{xc} = g^{a+xc} = g^z Figure 1 [1] The diagram on the right-hand side then shows an adaptive attack against this method,