3 #include <openssl/crypto.h>
4 #include <openssl/sha.h>
5 #include <openssl/err.h>
10 * In the definition, (xa, xb, xc, xd) are Alice's (x1, x2, x3, x4) or
11 * Bob's (x3, x4, x1, x2). If you see what I mean.
16 char *name; /* Must be unique */
21 BIGNUM *gxc; /* Alice's g^{x3} or Bob's g^{x1} */
22 BIGNUM *gxd; /* Alice's g^{x4} or Bob's g^{x2} */
28 BIGNUM *secret; /* The shared secret */
30 BIGNUM *xa; /* Alice's x1 or Bob's x3 */
31 BIGNUM *xb; /* Alice's x2 or Bob's x4 */
32 BIGNUM *key; /* The calculated (shared) key */
35 static void JPAKE_ZKP_init(JPAKE_ZKP *zkp)
41 static void JPAKE_ZKP_release(JPAKE_ZKP *zkp)
47 /* Two birds with one stone - make the global name as expected */
48 #define JPAKE_STEP_PART_init JPAKE_STEP2_init
49 #define JPAKE_STEP_PART_release JPAKE_STEP2_release
51 void JPAKE_STEP_PART_init(JPAKE_STEP_PART *p)
54 JPAKE_ZKP_init(&p->zkpx);
57 void JPAKE_STEP_PART_release(JPAKE_STEP_PART *p)
59 JPAKE_ZKP_release(&p->zkpx);
63 void JPAKE_STEP1_init(JPAKE_STEP1 *s1)
65 JPAKE_STEP_PART_init(&s1->p1);
66 JPAKE_STEP_PART_init(&s1->p2);
69 void JPAKE_STEP1_release(JPAKE_STEP1 *s1)
71 JPAKE_STEP_PART_release(&s1->p2);
72 JPAKE_STEP_PART_release(&s1->p1);
75 static void JPAKE_CTX_init(JPAKE_CTX *ctx, const char *name,
76 const char *peer_name, const BIGNUM *p,
77 const BIGNUM *g, const BIGNUM *q,
80 ctx->p.name = OPENSSL_strdup(name);
81 ctx->p.peer_name = OPENSSL_strdup(peer_name);
85 ctx->secret = BN_dup(secret);
87 ctx->p.gxc = BN_new();
88 ctx->p.gxd = BN_new();
93 ctx->ctx = BN_CTX_new();
96 static void JPAKE_CTX_release(JPAKE_CTX *ctx)
98 BN_CTX_free(ctx->ctx);
99 BN_clear_free(ctx->key);
100 BN_clear_free(ctx->xb);
101 BN_clear_free(ctx->xa);
106 BN_clear_free(ctx->secret);
110 OPENSSL_free(ctx->p.peer_name);
111 OPENSSL_free(ctx->p.name);
113 memset(ctx, '\0', sizeof *ctx);
116 JPAKE_CTX *JPAKE_CTX_new(const char *name, const char *peer_name,
117 const BIGNUM *p, const BIGNUM *g, const BIGNUM *q,
118 const BIGNUM *secret)
120 JPAKE_CTX *ctx = OPENSSL_malloc(sizeof *ctx);
124 JPAKE_CTX_init(ctx, name, peer_name, p, g, q, secret);
129 void JPAKE_CTX_free(JPAKE_CTX *ctx)
131 JPAKE_CTX_release(ctx);
135 static void hashlength(SHA_CTX *sha, size_t l)
139 OPENSSL_assert(l <= 0xffff);
142 SHA1_Update(sha, b, 2);
145 static void hashstring(SHA_CTX *sha, const char *string)
147 size_t l = strlen(string);
150 SHA1_Update(sha, string, l);
153 static int hashbn(SHA_CTX *sha, const BIGNUM *bn)
155 size_t l = BN_num_bytes(bn);
156 unsigned char *bin = OPENSSL_malloc(l);
163 SHA1_Update(sha, bin, l);
168 /* h=hash(g, g^r, g^x, name) */
169 static int zkp_hash(BIGNUM *h, const BIGNUM *zkpg, const JPAKE_STEP_PART *p,
170 const char *proof_name)
172 unsigned char md[SHA_DIGEST_LENGTH];
176 * XXX: hash should not allow moving of the boundaries - Java code
177 * is flawed in this respect. Length encoding seems simplest.
180 if (!hashbn(&sha, zkpg))
182 OPENSSL_assert(!BN_is_zero(p->zkpx.gr));
183 if (!hashbn(&sha, p->zkpx.gr))
185 if (!hashbn(&sha, p->gx))
187 hashstring(&sha, proof_name);
188 SHA1_Final(md, &sha);
189 BN_bin2bn(md, SHA_DIGEST_LENGTH, h);
194 * Prove knowledge of x
195 * Note that p->gx has already been calculated
197 static int generate_zkp(JPAKE_STEP_PART *p, const BIGNUM *x,
198 const BIGNUM *zkpg, JPAKE_CTX *ctx)
201 BIGNUM *r = BN_new();
202 BIGNUM *h = BN_new();
203 BIGNUM *t = BN_new();
207 * XXX: Java chooses r in [0, 2^160) - i.e. distribution not uniform
209 BN_rand_range(r, ctx->p.q);
211 BN_mod_exp(p->zkpx.gr, zkpg, r, ctx->p.p, ctx->ctx);
214 if (!zkp_hash(h, zkpg, p, ctx->p.name))
218 BN_mod_mul(t, x, h, ctx->p.q, ctx->ctx);
219 BN_mod_sub(p->zkpx.b, r, t, ctx->p.q, ctx->ctx);
230 static int verify_zkp(const JPAKE_STEP_PART *p, const BIGNUM *zkpg,
233 BIGNUM *h = BN_new();
234 BIGNUM *t1 = BN_new();
235 BIGNUM *t2 = BN_new();
236 BIGNUM *t3 = BN_new();
239 if (!zkp_hash(h, zkpg, p, ctx->p.peer_name))
243 BN_mod_exp(t1, zkpg, p->zkpx.b, ctx->p.p, ctx->ctx);
244 /* t2 = (g^x)^h = g^{hx} */
245 BN_mod_exp(t2, p->gx, h, ctx->p.p, ctx->ctx);
246 /* t3 = t1 * t2 = g^{hx} * g^b = g^{hx+b} = g^r (allegedly) */
247 BN_mod_mul(t3, t1, t2, ctx->p.p, ctx->ctx);
249 /* verify t3 == g^r */
250 if(BN_cmp(t3, p->zkpx.gr) == 0)
253 JPAKEerr(JPAKE_F_VERIFY_ZKP, JPAKE_R_ZKP_VERIFY_FAILED);
265 static int generate_step_part(JPAKE_STEP_PART *p, const BIGNUM *x,
266 const BIGNUM *g, JPAKE_CTX *ctx)
268 BN_mod_exp(p->gx, g, x, ctx->p.p, ctx->ctx);
269 if (!generate_zkp(p, x, g, ctx))
274 /* Generate each party's random numbers. xa is in [0, q), xb is in [1, q). */
275 static void genrand(JPAKE_CTX *ctx)
280 BN_rand_range(ctx->xa, ctx->p.q);
284 BN_copy(qm1, ctx->p.q);
287 /* ... and xb in [0, q-1) */
288 BN_rand_range(ctx->xb, qm1);
290 BN_add_word(ctx->xb, 1);
296 int JPAKE_STEP1_generate(JPAKE_STEP1 *send, JPAKE_CTX *ctx)
299 if (!generate_step_part(&send->p1, ctx->xa, ctx->p.g, ctx))
301 if (!generate_step_part(&send->p2, ctx->xb, ctx->p.g, ctx))
307 /* g^x is a legal value */
308 static int is_legal(const BIGNUM *gx, const JPAKE_CTX *ctx)
313 if(BN_is_negative(gx) || BN_is_zero(gx) || BN_cmp(gx, ctx->p.p) >= 0)
317 BN_mod_exp(t, gx, ctx->p.q, ctx->p.p, ctx->ctx);
324 int JPAKE_STEP1_process(JPAKE_CTX *ctx, const JPAKE_STEP1 *received)
326 if(!is_legal(received->p1.gx, ctx))
328 JPAKEerr(JPAKE_F_JPAKE_STEP1_PROCESS, JPAKE_R_G_TO_THE_X3_IS_NOT_LEGAL);
332 if(!is_legal(received->p2.gx, ctx))
334 JPAKEerr(JPAKE_F_JPAKE_STEP1_PROCESS, JPAKE_R_G_TO_THE_X4_IS_NOT_LEGAL);
338 /* verify their ZKP(xc) */
339 if(!verify_zkp(&received->p1, ctx->p.g, ctx))
341 JPAKEerr(JPAKE_F_JPAKE_STEP1_PROCESS, JPAKE_R_VERIFY_X3_FAILED);
345 /* verify their ZKP(xd) */
346 if(!verify_zkp(&received->p2, ctx->p.g, ctx))
348 JPAKEerr(JPAKE_F_JPAKE_STEP1_PROCESS, JPAKE_R_VERIFY_X4_FAILED);
353 if(BN_is_one(received->p2.gx))
355 JPAKEerr(JPAKE_F_JPAKE_STEP1_PROCESS, JPAKE_R_G_TO_THE_X4_IS_ONE);
359 /* Save the bits we need for later */
360 BN_copy(ctx->p.gxc, received->p1.gx);
361 BN_copy(ctx->p.gxd, received->p2.gx);
367 int JPAKE_STEP2_generate(JPAKE_STEP2 *send, JPAKE_CTX *ctx)
371 BIGNUM *t1 = BN_new();
372 BIGNUM *t2 = BN_new();
375 * X = g^{(xa + xc + xd) * xb * s}
378 BN_mod_exp(t1, ctx->p.g, ctx->xa, ctx->p.p, ctx->ctx);
379 /* t2 = t1 * g^{xc} = g^{xa} * g^{xc} = g^{xa + xc} */
380 BN_mod_mul(t2, t1, ctx->p.gxc, ctx->p.p, ctx->ctx);
381 /* t1 = t2 * g^{xd} = g^{xa + xc + xd} */
382 BN_mod_mul(t1, t2, ctx->p.gxd, ctx->p.p, ctx->ctx);
384 BN_mod_mul(t2, ctx->xb, ctx->secret, ctx->p.q, ctx->ctx);
388 * XXX: this is kinda funky, because we're using
390 * g' = g^{xa + xc + xd}
392 * as the generator, which means X is g'^{xb * s}
393 * X = t1^{t2} = t1^{xb * s} = g^{(xa + xc + xd) * xb * s}
395 ret = generate_step_part(send, t2, t1, ctx);
404 /* gx = g^{xc + xa + xb} * xd * s */
405 static int compute_key(JPAKE_CTX *ctx, const BIGNUM *gx)
407 BIGNUM *t1 = BN_new();
408 BIGNUM *t2 = BN_new();
409 BIGNUM *t3 = BN_new();
412 * K = (gx/g^{xb * xd * s})^{xb}
413 * = (g^{(xc + xa + xb) * xd * s - xb * xd *s})^{xb}
414 * = (g^{(xa + xc) * xd * s})^{xb}
415 * = g^{(xa + xc) * xb * xd * s}
416 * [which is the same regardless of who calculates it]
419 /* t1 = (g^{xd})^{xb} = g^{xb * xd} */
420 BN_mod_exp(t1, ctx->p.gxd, ctx->xb, ctx->p.p, ctx->ctx);
422 BN_sub(t2, ctx->p.q, ctx->secret);
423 /* t3 = t1^t2 = g^{-xb * xd * s} */
424 BN_mod_exp(t3, t1, t2, ctx->p.p, ctx->ctx);
425 /* t1 = gx * t3 = X/g^{xb * xd * s} */
426 BN_mod_mul(t1, gx, t3, ctx->p.p, ctx->ctx);
428 BN_mod_exp(ctx->key, t1, ctx->xb, ctx->p.p, ctx->ctx);
438 int JPAKE_STEP2_process(JPAKE_CTX *ctx, const JPAKE_STEP2 *received)
440 BIGNUM *t1 = BN_new();
441 BIGNUM *t2 = BN_new();
445 * g' = g^{xc + xa + xb} [from our POV]
448 BN_mod_add(t1, ctx->xa, ctx->xb, ctx->p.q, ctx->ctx);
449 /* t2 = g^{t1} = g^{xa+xb} */
450 BN_mod_exp(t2, ctx->p.g, t1, ctx->p.p, ctx->ctx);
451 /* t1 = g^{xc} * t2 = g^{xc + xa + xb} */
452 BN_mod_mul(t1, ctx->p.gxc, t2, ctx->p.p, ctx->ctx);
454 if(verify_zkp(received, t1, ctx))
457 JPAKEerr(JPAKE_F_JPAKE_STEP2_PROCESS, JPAKE_R_VERIFY_B_FAILED);
459 compute_key(ctx, received->gx);
468 static int quickhashbn(unsigned char *md, const BIGNUM *bn)
473 if (!hashbn(&sha, bn))
475 SHA1_Final(md, &sha);
479 void JPAKE_STEP3A_init(JPAKE_STEP3A *s3a)
482 int JPAKE_STEP3A_generate(JPAKE_STEP3A *send, JPAKE_CTX *ctx)
484 if (!quickhashbn(send->hhk, ctx->key))
486 SHA1(send->hhk, sizeof send->hhk, send->hhk);
491 int JPAKE_STEP3A_process(JPAKE_CTX *ctx, const JPAKE_STEP3A *received)
493 unsigned char hhk[SHA_DIGEST_LENGTH];
495 if (!quickhashbn(hhk, ctx->key))
497 SHA1(hhk, sizeof hhk, hhk);
498 if(memcmp(hhk, received->hhk, sizeof hhk))
500 JPAKEerr(JPAKE_F_JPAKE_STEP3A_PROCESS, JPAKE_R_HASH_OF_HASH_OF_KEY_MISMATCH);
506 void JPAKE_STEP3A_release(JPAKE_STEP3A *s3a)
509 void JPAKE_STEP3B_init(JPAKE_STEP3B *s3b)
512 int JPAKE_STEP3B_generate(JPAKE_STEP3B *send, JPAKE_CTX *ctx)
514 if (!quickhashbn(send->hk, ctx->key))
519 int JPAKE_STEP3B_process(JPAKE_CTX *ctx, const JPAKE_STEP3B *received)
521 unsigned char hk[SHA_DIGEST_LENGTH];
523 if (!quickhashbn(hk, ctx->key))
525 if(memcmp(hk, received->hk, sizeof hk))
527 JPAKEerr(JPAKE_F_JPAKE_STEP3B_PROCESS, JPAKE_R_HASH_OF_KEY_MISMATCH);
533 void JPAKE_STEP3B_release(JPAKE_STEP3B *s3b)
536 const BIGNUM *JPAKE_get_shared_key(JPAKE_CTX *ctx)