186 |
The effects of this algorithm and the parameters `$q$` and `$N$` |
The effects of this algorithm and the parameters `$q$` and `$N$` |
187 |
are analyzed in the next section. |
are analyzed in the next section. |
188 |
|
|
189 |
|
Security of this construction |
190 |
|
|
191 |
|
|
192 |
.. If *p* is a private key, let *pub(p)* be |
.. If *p* is a private key, let *pub(p)* be |
193 |
the public key corresponding to it. For a message m, let |
the public key corresponding to it. For a message m, let |
293 |
Analysis: Characterizing one-time signature schemes |
Analysis: Characterizing one-time signature schemes |
294 |
=================================================== |
=================================================== |
295 |
|
|
296 |
- defer discussion of the choice of `$x$` to the next Section. |
To compare possible one-time signature schemes for use |
297 |
|
with our algorithm, we |
298 |
|
|
299 |
We shall characterize the underlying one-time signature scheme by |
We shall characterize the underlying one-time signature scheme by |
300 |
a octuplet `$(q, b, s, r, h, c_0, c_s, c_v)$`, where |
a octuplet `$(q, b, s, r, h, c_0, c_s, c_v)$`, where |