Abstract by anuja a sonalker on Asymmetric Key Distribution

Table 4.2: Key generation and Distribution timings. 
d
k
= 512 bits 
d
k
= 1024 bits 
d
k
= 2048 bits 
Threshold 
Total 
Time 
Key 
Gen 
Key 
Dist. 
Total 
Time 
Key 
Gen 
Key 
Dist. 
Total 
Time 
Key 
Gen 
Key 
Dist. 
4 out of 7 15086 
6888 
8198 23434 12288 11146 
69912 
38712 31200 
5 out of 7 
9631 
6785 
2846 18313 12590 
5723 
65486 
39421 26065 
6 out of 7 
7763 
6842 
921 
16225 12639 
3586 
53658 
35212 18446 
Table 4.2 shows the time taken for key share generation and distribution for four 
subsequent runs for various Key sizes and thresholds out-of 7. 
Table 4.3: Key generation timings with and without key share reuse. 
512 1024 2048 
Run 
With reuse
(7 sets) 
Without reuse 
(21 sets) 
With reuse
(7 sets) 
Without reuse 
(21 sets) 
With reuse
(7 sets) 
Without reuse 
(21 sets) 
1 
2961 9965 5667 25198 25433 
114448 
2 
2818 10752 5748 25424 26221 
121665 
3 
2763 10767 5793 25507 26855 
116819 
4 
2842 9993 5684 25256 25751 
117994 
Table 4.3 shows the time taken for key generation and distribution with and without 
using the key share reuse technique for a threshold of 5-out-of-7. As seen in table 4.3, 
approximately 10.3 seconds are required to generate a 512-bit key without reusing key 
shares. For a threshold of 5-out-of-7 this means generating 21 sets of 5 shares each. If we 
reuse key shares then we need to generate only 7 sets of 5 shares each. This takes 
approximately 2.8 seconds which is roughly 
4
1
th the time taken if we create all new 
shares. Similar improvements are seen for 1024 and 2048 bit keys. From the data we 
have observed, it seems very apparent that key share reuse is very advantageous as far as 
saving time in the process of key generation. 

---

47 
512
1024
2048
with Reuse
without Reuse
0
20
40
60
80
100
120