/[gzz]/manuscripts/Sigs/article.rst
ViewVC logotype

Diff of /manuscripts/Sigs/article.rst

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.33 by benja, Sat May 17 17:03:07 2003 UTC revision 1.34 by tjl, Sat May 17 17:48:58 2003 UTC
# Line 261  the algorithm for choosing `$x$`. Line 261  the algorithm for choosing `$x$`.
261    
262      - tree of hashes, publish one public key and hashes of tree branches:      - tree of hashes, publish one public key and hashes of tree branches:
263        contributes `$s + r + h \\log k$` bits to sig and        contributes `$s + r + h \\log k$` bits to sig and
264        `$2k-1$` extra hashes to `$c_s$` and `$k-1$` to `$c_v$`.        `$2k-1$` extra hashes to `$c_s$` and `$\\log k$` to `$c_v$`.
265    
266    
267  - Our scheme, in the third alternative, maps a scheme  - Our scheme, in the third alternative, maps a scheme
# Line 276  Choice of `$x$` Line 276  Choice of `$x$`
276    
277  - Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more)  - Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more)
278    number of keys, if for each *hash* its own private key for signing it!    number of keys, if for each *hash* its own private key for signing it!
279    This means that `$N \\log k \ge h$`    This means that `$N \\log k \\ge h$`
280    
281      - this is a nice theoretical result: it *is* possible to sign anything      - this is a nice theoretical result: it *is* possible to sign anything
282        without trapdoors        without trapdoors

Legend:
Removed from v.1.33  
changed lines
  Added in v.1.34

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26