193 |
`$k$`, the branching factor of the tree, and |
`$k$`, the branching factor of the tree, and |
194 |
the algorithm for choosing `$x$`. |
the algorithm for choosing `$x$`. |
195 |
|
|
196 |
|
BENJA: LENGTH OF PUBLIC KEY OF OTS vs LENGTH OF SIGNED STRING! |
197 |
|
|
198 |
First, the obvious facts: for a given `$N$` and `$k$`, there are `$k^N$` |
First, the obvious facts: for a given `$N$` and `$k$`, there are `$k^N$` |
199 |
possible private keys for signing messages. |
possible private keys for signing messages. |
200 |
|
|
202 |
at each tree level: either signing all the public |
at each tree level: either signing all the public |
203 |
keys at one time, or signing each one separately using |
keys at one time, or signing each one separately using |
204 |
some algorithm, as described in the Introduction, to |
some algorithm, as described in the Introduction, to |
205 |
sign a small number of messages using |
sign a small number of messages using a one-time-signature algorithm. |
206 |
|
|
207 |
|
|
208 |
Applicability to Digital Publishing |
Applicability to Digital Publishing |
209 |
=================================== |
=================================== |
210 |
|
|
211 |
|
|
212 |
|
|
213 |
Conclusion |
Conclusion |
214 |
========== |
========== |
215 |
|
|
216 |
|
|
217 |
|
|
218 |
|
|
219 |
|
|