demos/jpake/jpakedemo.c

35     // For now use p, q, g from Java sample code. Later, generate them.
211                      const JPakeUserPublic * them, const BIGNUM *zkpg,
221     zkpHash(h, zkp, gx, them, params);
264 static void sendstep1(const JPakeUser * us, JPakeUserPublic * them,
267     printf("\n%s sends %s:\n\n", us->p.name, them->name);
270     sendstep1_substep(&them->s1c, us->xa, us, params, us->p.base);
272     sendstep1_substep(&them->s1d, us->xb, us, params, us->p.base + 1);
275 static int verifystep1(const JPakeUser * us, const JPakeUserPublic * them,
278     printf("\n%s verifies %s:\n\n", us->p.name, them->name);
281     if (!VerifyZKP(&us->p.s1c.zkpx, us->p.s1c.gx, them, params->g, params,
282                    them->base, ""))
286     if (!VerifyZKP(&us->p.s1d.zkpx, us->p.s1d.gx, them, params->g, params,
287                    them->base + 1, ""))
291     printf("  g^{x%d} != 1: ", them->base + 1);
301 static void sendstep2(const JPakeUser * us, JPakeUserPublic * them,
307     printf("\n%s sends %s:\n\n", us->p.name, them->name);
319     them->s2.X = BN_new();
320     BN_mod_exp(them->s2.X, t1, t2, params->p, params->ctx);
323     printf("  g^{(x%d + x%d + x%d) * x%d * s)", us->p.base, them->base,
324            them->base + 1, us->p.base + 1);
325     showbn("", them->s2.X);
333     CreateZKP(&them->s2.zkpxbs, t2, us, t1, params, us->p.base + 1, " * s");
340 static int verifystep2(const JPakeUser * us, const JPakeUserPublic * them,
347     printf("\n%s verifies %s:\n\n", us->p.name, them->name);
358         (&us->p.s2.zkpxbs, us->p.s2.X, them, t1, params, them->base + 1,
458     // Since we're all the same code, just compare them directly. In a