//c_iとk_iをペアリングする関数
//¬記号で別々の処理する
//(v_i - x_t)も必要→とりあえず置いておこう……→一応できた？
Element *pairing_c_k(EC_PAIRING p, rho_i *rho, EC_POINT *c, EC_POINT *k, mpz_t *alpha_i) {
int i;
Element *result;
result = (Element*)malloc(sizeof(Element));
Element egg, tempegg1, tempegg2;
element_init(egg, p->g3);
element_init(tempegg1, p->g3);
element_init(tempegg2, p->g3);
element_init(*result, p->g3);
mpz_t temp1;
mpz_init(temp1);
mpz_t temp2;
mpz_init(temp2);
mpz_t order;
mpz_init(order);
mpz_set(order, *pairing_get_order(p));
element_set_one(*result);
if (alpha_i == NULL && rho == NULL) { //e(c_0, k_0)
for (i = 0; i < 5; i++) {
pairing_map(tempegg1, c[i], k[i], p);
element_mul(tempegg2, tempegg1, *result);
element_set(*result, tempegg2);
}
}
else if (mpz_cmp_ui(*alpha_i, 0) == 0) {//return 1
}
else if (rho->is_negated == FALSE) {
for (i = 0; i < 7; i++) {
pairing_map(tempegg1, c[i], k[i], p);
element_mul(tempegg2, tempegg1, *result);
element_set(*result, tempegg2);
}
element_pow(tempegg1, *result, *alpha_i);
element_set(*result, tempegg1);
}
else { //is_negated == TRUE
for (i = 0; i < 7; i++) {
pairing_map(tempegg1, c[i], k[i], p);
element_mul(tempegg2, tempegg1, *result);
element_set(*result, tempegg2);
}
mpz_set_ui(temp1, rho->v_t[0]); //v_i - x_t
mpz_invert(temp2, temp1, order);
mpz_mul(temp1, temp2, *alpha_i); // alpha_i / (v_i - x_t)
mpz_mod(*alpha_i, temp1, order);
element_pow(tempegg1, *result, *alpha_i);
element_set(*result, tempegg1);
}
mpz_clear(order);
mpz_clear(temp2);
mpz_clear(temp1);
element_clear(egg);
element_clear(tempegg1);
element_clear(tempegg2);
return result;
}
void point_set_xy(EC_POINT p, const Element x, const Element y)
{
element_set(p->x, x);
element_set(p->y, y);
element_set_one(p->z);
p->isinfinity = FALSE;
}
//============================================
// 四則演算のテストプログラム
//============================================
void test_arithmetic_operation(Field f)
{
int i;
unsigned long long int t1, t2;
Element a, b, c, d;
char loop[] = "100";
mpz_t e, exp;
//--------------------
// init
//--------------------
element_init(a, f);
element_init(b, f);
element_init(c, f);
element_init(d, f);
//--------------------
// add
//--------------------
element_set_str(a, "1C12C39A2AD14054EDC9EE504301127AFFEEAADC59A78B50FCFFED87AC6EB8BF 20E1A922384561EA82602CD664D85D442DAC5D391E142ABB3CFEC2A095C22DF9");
element_set_str(b, "F1B91250A124F268B8239185B23B31EB25179A11A9A0398E61B701F7D4F7265 20D206C5F7D007EDBA34A4B041622289D64F04CA28CEAC490619585AA14F7B2F");
element_set_str(d, "7BD59BA97A27FBD2AD60CD0173FC358353DE53D5C418EE8649AFDA729BE2B23 1E42B4E392D45A19EE1EB6EE1F557D8C86F922C32EE2D702C497BAFB3711A927");
element_add(c, a, b);
assert(element_cmp(c, d) == 0);
t1 = rdtsc();
for (i = 0; i < N; i++) { element_add(c, a, b); }
t2 = rdtsc();
printf("element add: %.2lf [clock]\n", (double)(t2 - t1) / N);
//--------------------
// sub
//--------------------
element_set(d, c);
element_sub(c, c, d);
assert(element_is_zero(c));
//--------------------
// mul
//--------------------
element_mul(c, a, b);
element_set_str(d, "1D0562FF0AB317FFDE555320A7072D2B29C07077E08996CE5F093BB8E4200B2C 9B04361A24DC7F37C8BD09A7C51A9D8577168AD021BF2B4AC3D67552F481B1A");
assert(element_cmp(c, d) == 0);
t1 = rdtsc();
for (i = 0; i < N; i++) { element_mul(c, a, b); }
t2 = rdtsc();
printf("element mul: %.2lf [clock]\n", (double)(t2 - t1) / N);
mpz_init_set_str(e, "1B45F16C848B9C476C1D2FF1FD60A0D0C19BBA6F3ECE3CF6C5FCE4FAB7CAD4FF", 16);
element_pow(c, a, e);
element_set_str(d, "B40190CE812CB4F668A839952128D19B1748F3BB19E902480D089AF9053A6D2 19DA59F09C3C20472C3BD19A4FC95BCAF266B9D1539AAD23E3C67C4F3A7CA51D");
assert(element_cmp(c, d) == 0);
mpz_clear(e);
//--------------------
// sqr
//--------------------
element_sqr(c, a);
element_mul(d, a, a);
assert(element_cmp(c, d) == 0);
t1 = rdtsc();
for (i = 0; i < N; i++) { element_sqr(c, a); }
t2 = rdtsc();
printf("element sqr: %.2lf [clock]\n", (double)(t2 - t1) / N);
//--------------------
// random
//--------------------
element_random(a);
element_random(b);
//--------------------
// inv
//--------------------
element_mul(c, a, b);
element_inv(b, b);
element_mul(c, c, b);
element_inv(d, a);
element_mul(d, a, d);
assert(element_cmp(c, a) == 0);
assert(element_is_one(d));
t1 = rdtsc();
for (i = 0; i < N; i++) { element_inv(b, a); }
t2 = rdtsc();
printf("element inv: %.2lf [clock]\n", (double)(t2 - t1) / N);
//--------------------
// pow
//--------------------
mpz_init_set_str(exp, loop, 10);
element_set_one(b);
for (i = 0; i < atoi(loop); i++) { element_mul(b, b, a); }
element_pow(c, a, exp);
assert(element_cmp(b, c) == 0);
mpz_set(exp, f->order);
for (i = 0; i < 100; i++)
{
element_random(a);
element_pow(b, a, exp);
assert(element_cmp(b, a) == 0);
}
t1 = rdtsc();
for (i = 0; i < N; i++) { element_pow(b, a, exp); }
t2 = rdtsc();
printf("element pow with order: %.2lf [clock]\n", (double)(t2 - t1) / N);
mpz_clear(exp);
//--------------------
// clear
//--------------------
element_clear(a);
element_clear(b);
element_clear(c);
element_clear(d);
}
