Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
fact to toss coins and send them as challenges to the prover. Let’s show the beautiful idea in the case of GNI. The rough idea is as follows: assume the graphs have n vertices each. Forgetting for a moment about automorphisms of graphs, we see that in case the graphs are not isomorphic there are 2