358 |
private keys |
private keys |
359 |
defined in the virtual tree. |
defined in the virtual tree. |
360 |
|
|
361 |
It is also possible to use key boosting to form `$k$`-time |
.. It is also possible to use key boosting to form `$k$`-time |
362 |
signature schemes for large `$k$`. For example, for `$k=2^20$`: |
signature schemes for large `$k$`. For example, for `$k=2^20$`: |
363 |
|
|
364 |
- key_boosting_real(5, 4, 160):: |
- key_boosting_real(5, 4, 160):: |
365 |
|
|
366 |
(q=2^20.0, b=160, s=17.08984375 KB, |
(q=2^20.0, b=160, s=17.08984375 KB, |
367 |
r=20 B, h=20 B, |
r=20 B, h=20 B, |
368 |
t0=3.41e+03 [~17.035ms], |
t0=3.41e+03 [~17.035ms], |
369 |
ts=1.70e+04 [~85.175ms], |
ts=1.70e+04 [~85.175ms], |
370 |
tv=8.65e+02 [~4.325ms]) |
tv=8.65e+02 [~4.325ms]) |
371 |
|
|
372 |
Of course, there is the common technique to create a tree |
Of course, there is the common technique to create a tree |
373 |
of one-time signatures, where each key at the top signs |
of one-time signatures, where each key at the top signs |
374 |
a number of keys below it. Using our scheme is only a variant, |
a number of keys below it. Using our scheme is only a variant, |
375 |
which may be somewhat more convenient sometimes because |
which may be somewhat more convenient sometimes because |
376 |
it only requires storing the number of keys already used, |
it only requires storing the number of keys already used, |
377 |
not a whole tree of private keys. |
not a whole tree of private keys. |
378 |
|
|
379 |
|
|
380 |
Conclusion |
Conclusion |