1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
#include <pbc.h>
#include "pbc_test.h"
void time_pairing(pairing_ptr pairing) {
int i, n;
double t0, t1, ttotal, ttotalpp;
pairing_pp_t pp;
element_t x, y, r, r2;
element_init_G1(x, pairing);
element_init_G2(y, pairing);
element_init_GT(r, pairing);
element_init_GT(r2, pairing);
n = 10;
ttotal = 0.0;
ttotalpp = 0.0;
for (i=0; i<n; i++) {
element_random(x);
element_random(y);
pairing_pp_init(pp, x, pairing);
t0 = pbc_get_time();
pairing_pp_apply(r, y, pp);
t1 = pbc_get_time();
ttotalpp += t1 - t0;
pairing_pp_clear(pp);
t0 = pbc_get_time();
element_pairing(r2, x, y);
t1 = pbc_get_time();
ttotal += t1 - t0;
//element_printf("x = %B\n", x);
//element_printf("y = %B\n", y);
//element_printf("e(x,y) = %B\n", r);
if (element_cmp(r, r2)) {
printf("BUG!\n");
exit(1);
}
}
printf("average pairing time = %f\n", ttotal / n);
printf("average pairing time (preprocessed) = %f\n", ttotalpp / n);
element_clear(x);
element_clear(y);
element_clear(r);
element_clear(r2);
}
int main(int argc, char **argv) {
pairing_t pairing;
pbc_demo_pairing_init(pairing, argc, argv);
printf("Miller's algorithm\n");
time_pairing(pairing);
pairing_option_set(pairing, "method", "shipsey-stange");
printf("Shipsey-Stange algorithm\n");
time_pairing(pairing);
pairing_clear(pairing);
return 0;
}
|
