191 |
Obtaining the minimal integral solutions of this inequality |
Obtaining the minimal integral solutions of this inequality |
192 |
gives us a tradeoff where the length of the signature is approximately |
gives us a tradeoff where the length of the signature is approximately |
193 |
linear with `$N$` and the time to sign grows exponentially with `$n$`. |
linear with `$N$` and the time to sign grows exponentially with `$n$`. |
194 |
|
Table [ref-tabtradeoff]_ shows |
195 |
|
|
|
All choices produce a *linear* operation from the characteristics |
|
|
of a scheme to the characteristics of the other scheme. |
|
|
Particularly, the signature length increases linearly with `$N$`, |
|
|
and the time to sign grows exponentially with `$n$` and |
|
|
linearly (in the opposite direction!) with `$N$`. |
|
196 |
|
|
197 |
.. raw:: latex |
.. raw:: latex |
198 |
|
|
206 |
\input kbmhtrade |
\input kbmhtrade |
207 |
\hline |
\hline |
208 |
\end{tabular} |
\end{tabular} |
209 |
\caption{The tradeoff between rounds of key boosting |
\caption{\label{tabtradeoff} |
210 |
|
The tradeoff between rounds of key boosting |
211 |
and branching factor when using key boosting |
and branching factor when using key boosting |
212 |
and Merkle hash trees to |
and Merkle hash trees to |
213 |
obtain the full digital signature feature set |
obtain the full digital signature feature set |