96 |
as block ciphers or cryptographic hashes so that |
as block ciphers or cryptographic hashes so that |
97 |
that given `$y$` it is infeasible to find `$x$`. |
that given `$y$` it is infeasible to find `$x$`. |
98 |
Given a one-way function f, the signer generates a set |
Given a one-way function f, the signer generates a set |
99 |
of (pseudo)random numbers and and publishes f(x) for each |
of (pseudo)random numbers and and publishes `$f(x)$` for each |
100 |
x in the set. This is the public key. To sign a message, |
`$x$` in the set. This is the public key. To sign a message, |
101 |
the signer employs a deterministic algorithm to select |
the signer employs a deterministic algorithm to select |
102 |
a subset of the random numbers, and publishes them |
a subset of the random numbers, and publishes them |
103 |
as the signature. The signature can be verified by running |
as the signature. The signature can be verified by running |
214 |
functions. |
functions. |
215 |
|
|
216 |
To sign `$b$` bits, choose `$t$` and `$k$` such that |
To sign `$b$` bits, choose `$t$` and `$k$` such that |
217 |
`$ {t \choose k} \ge b $` |
`$ {t \\choose k} \\ge b $` |
218 |
|
|
219 |
Parameters `$t$` and `$k$`. |
Parameters `$t$` and `$k$`. |
220 |
|
|
437 |
|
|
438 |
In order to work, key boosting requires the |
In order to work, key boosting requires the |
439 |
hash tree as a basis to obtain an basis algorithm |
hash tree as a basis to obtain an basis algorithm |
440 |
with `$q' \ne 1$`. |
with `$q' \\ne 1$`. |
441 |
|
|
442 |
The values for Bleichenbacher and Maurer's algorithm |
The values for Bleichenbacher and Maurer's algorithm |
443 |
|
|