/[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.38 by tjl, Sat May 17 18:11:46 2003 UTC revision 1.39 by tjl, Sat May 17 18:14:08 2003 UTC
# Line 124  in a digital publishing context. Line 124  in a digital publishing context.
124  One-time Signature Key Boosting  One-time Signature Key Boosting
125  ===============================  ===============================
126    
127  This scheme is based on two primitives: 1) A `$k$`-time-signature  This scheme is based on two primitives: 1) A `$q$`-time-signature
128  algorithm which takes a random number as its private key, and  algorithm which takes a random number as its private key, and
129  2) a random oracle which generates an apparently random  2) a random oracle which generates an apparently random
130  bitstring from a given number.  bitstring from a given number.
# Line 139  we start by setting `$p$` to the Line 139  we start by setting `$p$` to the
139  private key.  private key.
140  Then, we iterate over the following steps `$N$` times:  Then, we iterate over the following steps `$N$` times:
141    
142  1. Choose `$x \\in [1,k]$`. The exact algorithm for making this  1. Choose `$x \\in [1,q]$`. The exact algorithm for making this
143     choice parametrizes the algorithm; possible choices are discussed     choice parametrizes the algorithm; possible choices are discussed
144     below.     below.
145    
# Line 148  Then, we iterate over the following step Line 148  Then, we iterate over the following step
148    
149  3. Sign the corresponding public key with `$p$`. This does  3. Sign the corresponding public key with `$p$`. This does
150     not present     not present
151     a problem for the `$k$`-time signature algorithm, since     a problem for the `$q$`-time signature algorithm, since
152     the random oracle is deterministic and     the random oracle is deterministic and
153     no more than `$k$` strings will therefore be signed     no more than `$q$` strings will therefore be signed
154     with any given `$p$`.     with any given `$p$`.
155    
156  4.  `$p \\leftarrow p_x$`  4.  `$p \\leftarrow p_x$`
# Line 165  chain of signatures Line 165  chain of signatures
165    
166  As long as the algorithm for choosing `$x$` does not yield the same  As long as the algorithm for choosing `$x$` does not yield the same
167  chain for two messages, the signatures XXX  chain for two messages, the signatures XXX
168  The effects of this algorithm and the parameters `$k$` and `$N$`  The effects of this algorithm and the parameters `$q$` and `$N$`
169  are analyzed in the next section.  are analyzed in the next section.
170    
171    

Legend:
Removed from v.1.38  
changed lines
  Added in v.1.39

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