I am trying to build this (ero-knowledge_proof: Discrete_log_of_a_given_value), but I don't understand how to implement C = gr• (gx)-1 mod p without actually calculating x. Any pointers would be helpful.
Asked
Active
Viewed 98 times
0
Al Foиce ѫ
- 4,195
- 12
- 39
- 49
c6695610
- 1
- 2
-
1`g^x=y`, which is one of the values known to both parties. – Nico Schertler Oct 30 '19 at 23:11
-
@NicoSchertler right, but how do you get from that to `(g^x)^-1 mod p` – c6695610 Oct 31 '19 at 00:47
-
1`(g^x)^-1` is the multiplicative inverse of `y`. – Nico Schertler Oct 31 '19 at 01:19
-
[Modular inverse](https://en.wikipedia.org/wiki/Modular_multiplicative_inverse). – President James K. Polk Oct 31 '19 at 01:38
-
2Possible duplicate of [Modular Inverse Calculation](https://stackoverflow.com/questions/58618167/modular-inverse-calculation) – Spektre Oct 31 '19 at 07:29