189 |
======== |
======== |
190 |
|
|
191 |
We shall characterize the underlying one-time signature scheme by |
We shall characterize the underlying one-time signature scheme by |
192 |
a quadruplet `$(r, s, q, b)$` |
a septuplet `$(q, b, s, r, h, c_0, c_s, c_v)$`, where |
|
where `$r$` is the number of bits in a public key, |
|
|
`$s$` is the number of bits in a signature, |
|
193 |
`$q$` is the number of messages a single private key can be used to sign, |
`$q$` is the number of messages a single private key can be used to sign, |
194 |
and `$b$` is the number of bits in a single signed message. |
`$b$` is the number of bits in a single signed message. |
195 |
|
`$s$` is the number of bits in a signature, |
196 |
|
`$r$` is the number of bits in a public key, |
197 |
|
`$h$` is the number of bits a in the hash function used, |
198 |
|
`$c_0$` is the number of invocations of the hash function off-line at key generation, |
199 |
|
`$c_s$` is the number of invocations of the hash function when signing, |
200 |
|
and |
201 |
|
`$c_v$` is the number of invocations of the hash function when verifying. |
202 |
|
|
203 |
There are three parameters to the one-time signature key boosting algorithm: |
There are three parameters to the one-time signature key boosting algorithm: |
204 |
`$N$`, the number of levels in the private key tree, |
`$N$`, the number of levels in the private key tree, |