147 |
not present |
not present |
148 |
a problem for the one-time signature algorithm, since |
a problem for the one-time signature algorithm, since |
149 |
the string to be signed is always the same for a given key. |
the string to be signed is always the same for a given key. |
|
|
|
150 |
|
|
151 |
3. Choose `$x \in [1,k]$`. The exact algorithm for making this |
3. Choose `$x \in [1,k]$`. The exact algorithm for making this |
152 |
choice parametrizes the algorithm; possible choices are discussed |
choice parametrizes the algorithm; possible choices are discussed |
188 |
Analysis |
Analysis |
189 |
======== |
======== |
190 |
|
|
191 |
|
There are three parameters to the one-time signature key boosting algorithm: |
192 |
|
`$N$`, the number of levels in the private key tree, |
193 |
|
`$k$`, the branching factor of the tree, and |
194 |
|
the algorithm for choosing `$x$`. |
195 |
|
|
196 |
|
First, the obvious facts: for a given `$N$` and `$k$`, there are `$k^N$` |
197 |
|
possible private keys for signing messages. |
198 |
|
|
199 |
|
There are two alternatives for signing the subkeys |
200 |
|
at each tree level: either signing all the public |
201 |
|
keys at one time, or signing each one separately using |
202 |
|
some algorithm, as described in the Introduction, to |
203 |
|
sign a small number of messages using |
204 |
|
|
205 |
|
|
206 |
Applicability to Digital Publishing |
Applicability to Digital Publishing |
207 |
=================================== |
=================================== |
208 |
|
|