Parent Directory | Revision Log | Patch
revision 1.16 by tjl, Sat May 17 13:50:59 2003 UTC | revision 1.17 by benja, Sat May 17 14:06:45 2003 UTC | |
---|---|---|
# | Line 207 the algorithm for choosing `$x$`. | Line 207 the algorithm for choosing `$x$`. |
207 | ||
208 | BENJA: LENGTH OF PUBLIC KEY OF OTS vs LENGTH OF SIGNED STRING! | BENJA: LENGTH OF PUBLIC KEY OF OTS vs LENGTH OF SIGNED STRING! |
209 | ||
210 | - 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$`. | |
212 | ||
213 | 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$` |
214 | possible private keys for signing messages. | possible private keys for signing messages. |
215 |
|
savannah-hackers-public@gnu.org | ViewVC Help |
Powered by ViewVC 1.1.26 |