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 septuplet `$(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 |
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 |
`$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, |
`$s$` is the number of bits in a signature, |
210 |
- For the Lamport scheme, for given `$h$` and `$b$`, |
- For the Lamport scheme, for given `$h$` and `$b$`, |
211 |
`$q=1, s=bh, r=2bh, c_0=2bh, c_s=0, c_v=bh$`. |
`$q=1, s=bh, r=2bh, c_0=2bh, c_s=0, c_v=bh$`. |
212 |
|
|
213 |
|
+------------------+ |
214 |
|
| Scheme | |
215 |
|
+==================+ |
216 |
|
| Lamport [XXX]_ | |
217 |
|
| | |
218 |
|
+------------------+ |
219 |
|
|
220 |
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$` |
221 |
possible private keys for signing messages. |
possible private keys for signing messages. |
222 |
|
|