Lines Matching +defs:obj +defs:y

547 				ASN1_OBJECT *obj;
550 				obj = X509_EXTENSION_get_object(ext);
552 				if (OBJ_obj2nid(obj) ==
1146  * computes y = k + b r mod q and x = g^k mod p and sends (y, hash(x))
1151  * Alice receives the response and computes g^y v^r mod p. After a bit
1223 	 * Bob rolls random nonce k mod q, computes y = k + b r mod q
1224 	 * and x = g^k mod p, then sends (y, x) to Alice. He needs
1231 	BN_mod(v, v, q, ctx);		/* y = k + b r mod q */
1235 	 * Alice verifies x = g^y v^r to confirm that Bob has group key
1236 	 * b. She needs p, q, g from parameters, (y, x) from Bob and the
1237 	 * original r. We omit the detail here thatt only the hash of y
1240 	BN_mod_exp(v, g, v, p, ctx); /* g^y mod p */
1324  * request message. Bob rolls new random k, then computes y = k u^r mod
1325  * n and x = k^b mod n and sends (y, hash(x)) to Alice in the response
1330  * Alice receives the response and computes y^b v^r mod n. After a bit
1347 	BIGNUM	*u, *v, *g, *k, *r, *y; /* BN temps */
1368 	k = BN_new(); r = BN_new(); y = BN_new();
1403 		BN_free(g); BN_free(k); BN_free(r); BN_free(y);
1423 	 * Bob rolls random nonce k mod n, computes y = k u^r mod n and
1424 	 * g = k^b mod n, then sends (y, g) to Alice. He needs n, u, b
1429 	BN_mod_exp(y, u, r, n, ctx);	/* u^r mod n */
1430 	BN_mod_mul(y, k, y, n, ctx);	/* y = k u^r mod n */
1434 	 * Alice verifies g = v^r y^b mod n to confirm that Bob has
1436 	 * (u^-1)^b from the certificate, (y, g) from Bob and the
1441 	BN_mod_exp(y, y, b, n, ctx);	/* y^b mod n */
1442 	BN_mod_mul(y, v, y, n, ctx);	/* v^r y^b mod n */
1443 	temp = BN_cmp(y, g);
1444 	fprintf(stderr, "Confirm g^k = v^r y^b mod n: %s\n", temp == 0 ?
1447 	BN_free(g); BN_free(k); BN_free(r); BN_free(y);
1545  * request message. Bob rolls random nonce k mod q, encrypts y = r E^k
1546  * mod p and sends (y, gbar^k, ghat^k) to Alice.
1550  * decrypts y and verifies it matches the original r. The signed