188 |
Analysis |
Analysis |
189 |
======== |
======== |
190 |
|
|
191 |
|
We shall characterize the underlying one-time signature scheme by |
192 |
|
a quadruplet `$(r, s, q, b)$` |
193 |
|
where `$r$` is the number of bits in a public key, |
194 |
|
`$s$` is the number of bits in a signature, |
195 |
|
`$q$` is the number of messages a single private key can be used to sign, |
196 |
|
and `$b$` is the number of bits in a single signed message. |
197 |
|
|
198 |
There are three parameters to the one-time signature key boosting algorithm: |
There are three parameters to the one-time signature key boosting algorithm: |
199 |
`$N$`, the number of levels in the private key tree, |
`$N$`, the number of levels in the private key tree, |
200 |
`$k$`, the branching factor of the tree, and |
`$k$`, the branching factor of the tree, and |