int cp_bgn_mul(gt_t e[4], g1_t c[2], g2_t d[2]) {
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 2; j++) {
pc_map(e[2*i + j], c[i], d[j]);
}
}
return STS_OK;
}
status_t pairing_apply(element_t et, element_t e1, element_t e2)
{
LEAVE_IF(e1->isInitialized != TRUE || e2->isInitialized != TRUE || et->isInitialized != TRUE, "uninitialized arguments.");
if(e1->type == G1 && e2->type == G2 && et->type == GT) {
/* compute optimal ate pairing */
pc_map(et->gt, e1->g1, e2->g2);
//pp_map_oatep(et->gt, e1->g1, e2->g2);
//pp_map_k12(et->gt, e1->g1, e2->g2);
return ELEMENT_OK;
}
return ELEMENT_INVALID_ARG;
}
int cp_bls_ver(g1_t s, uint8_t *msg, int len, g2_t q) {
g1_t p;
g2_t g;
gt_t e1, e2;
int result = 0;
g1_null(p);
g2_null(g);
gt_null(e1);
gt_null(e2);
TRY {
g1_new(p);
g2_new(g);
gt_new(e1);
gt_new(e2);
g2_get_gen(g);
g1_map(p, msg, len);
pc_map(e1, p, q);
pc_map(e2, s, g);
if (gt_cmp(e1, e2) == CMP_EQ) {
result = 1;
}
}
CATCH_ANY {
THROW(ERR_CAUGHT);
}
FINALLY {
g1_free(p);
g2_free(g);
gt_free(e1);
gt_free(e2);
}
return result;
}
int cp_bbs_ver(g1_t s, uint8_t *msg, int len, int hash, g2_t q, gt_t z) {
bn_t m, n;
g2_t g;
gt_t e;
uint8_t h[MD_LEN];
int result = 0;
bn_null(m);
bn_null(n);
g2_null(g);
gt_null(e);
TRY {
bn_new(m);
bn_new(n);
g2_new(g);
gt_new(e);
g2_get_ord(n);
/* m = H(msg). */
if (hash) {
bn_read_bin(m, msg, len);
} else {
md_map(h, msg, len);
bn_read_bin(m, h, MD_LEN);
}
bn_mod(m, m, n);
g2_mul_gen(g, m);
g2_add(g, g, q);
g2_norm(g, g);
pc_map(e, s, g);
if (gt_cmp(e, z) == CMP_EQ) {
result = 1;
}
}
CATCH_ANY {
THROW(ERR_CAUGHT);
}
FINALLY {
bn_free(m);
bn_free(n);
g2_free(g);
gt_free(e);
}
return result;
}
void gt_get_gen(gt_t a) {
g1_t g1;
g2_t g2;
g1_null(g1);
g2_null(g2);
TRY {
g1_new(g1);
g2_new(g2);
g1_get_gen(g1);
g2_get_gen(g2);
pc_map(a, g1, g2);
} CATCH_ANY {
THROW(ERR_CAUGHT);
} FINALLY {
g1_free(g1);
g2_free(g2);
}
}
int cp_bbs_gen(bn_t d, g2_t q, gt_t z) {
bn_t n;
g1_t g;
int result = STS_OK;
bn_null(n);
g1_null(g);
TRY {
bn_new(n);
g1_new(g);
g1_get_gen(g);
g2_get_gen(q);
/* z = e(g1, g2). */
pc_map(z, g, q);
g2_get_ord(n);
do {
bn_rand(d, BN_POS, 2 * pc_param_level());
bn_mod(d, d, n);
} while (bn_is_zero(d));
/* q = d * g2. */
g2_mul_gen(q, d);
g2_norm(q, q);
}
CATCH_ANY {
result = STS_ERR;
}
FINALLY {
bn_free(n);
g1_free(g);
}
return result;
}
int cp_sokaka_key(uint8_t *key, unsigned int key_len, char *id1,
int len1, sokaka_t k, char *id2, int len2) {
int first = 0, result = STS_OK;
g1_t p;
g2_t q;
gt_t e;
g1_null(p);
g2_null(q);
gt_null(e);
TRY {
g1_new(p);
g2_new(q);
gt_new(e);
if (len1 == len2) {
if (strncmp(id1, id2, len1) == 0) {
THROW(ERR_NO_VALID);
}
first = (strncmp(id1, id2, len1) < 0 ? 1 : 2);
} else {
if (len1 < len2) {
if (strncmp(id1, id2, len1) == 0) {
first = 1;
} else {
first = (strncmp(id1, id2, len2) < 0 ? 1 : 2);
}
} else {
if (strncmp(id1, id2, len2) == 0) {
first = 2;
} else {
first = (strncmp(id1, id2, len2) < 0 ? 1 : 2);
}
}
}
if (pc_map_is_type1()) {
g2_map(q, (uint8_t *)id2, len2);
pc_map(e, k->s1, q);
} else {
if (first == 1) {
g2_map(q, (uint8_t *)id2, len2);
pc_map(e, k->s1, q);
} else {
g1_map(p, (uint8_t *)id2, len2);
pc_map(e, p, k->s2);
}
}
/* Allocate size for storing the output. */
uint8_t buf[gt_size_bin(e, 0)];
gt_write_bin(buf, sizeof(buf), e, 0);
md_kdf1(key, key_len, buf, sizeof(buf));
}
CATCH_ANY {
result = STS_ERR;
}
FINALLY {
g1_free(p);
g2_free(q);
gt_free(e);
}
return result;
}
int cp_bgn_dec(dig_t *out, gt_t in[4], bgn_t prv) {
int i, result = STS_ERR;
g1_t g;
g2_t h;
gt_t t[4];
bn_t n, r, s;
bn_null(n);
bn_null(r);
bn_null(s);
g1_null(g);
g2_null(h);
TRY {
bn_new(n);
bn_new(r);
bn_new(s);
g1_new(g);
g2_new(h);
for (i = 0; i < 4; i++) {
gt_null(t[i]);
gt_new(t[i]);
}
gt_exp(t[0], in[0], prv->x);
gt_exp(t[0], t[0], prv->x);
gt_mul(t[1], in[1], in[2]);
gt_exp(t[1], t[1], prv->x);
gt_inv(t[1], t[1]);
gt_mul(t[3], in[3], t[1]);
gt_mul(t[3], t[3], t[0]);
gt_get_ord(n);
g1_get_gen(g);
g2_get_gen(h);
bn_mul(r, prv->x, prv->y);
bn_sqr(r, r);
bn_mul(s, prv->x, prv->y);
bn_mul(s, s, prv->z);
bn_sub(r, r, s);
bn_sub(r, r, s);
bn_sqr(s, prv->z);
bn_add(r, r, s);
bn_mod(r, r, n);
pc_map(t[1], g, h);
gt_exp(t[1], t[1], r);
gt_copy(t[2], t[1]);
if (gt_is_unity(t[3]) == 1) {
*out = 0;
result = STS_OK;
} else {
for (i = 0; i < INT_MAX; i++) {
if (gt_cmp(t[2], t[3]) == CMP_EQ) {
*out = i + 1;
result = STS_OK;
break;
}
gt_mul(t[2], t[2], t[1]);
}
}
} CATCH_ANY {
result = STS_ERR;
} FINALLY {
bn_free(n);
bn_free(r);
bn_free(s);
g1_free(g);
g2_free(h);
for (i = 0; i < 4; i++) {
gt_free(t[i]);
}
}
return result;
}
