gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] manuscripts/Sigs article.rst


From: Tuomas J. Lukka
Subject: [Gzz-commits] manuscripts/Sigs article.rst
Date: Sat, 17 May 2003 14:14:08 -0400

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/17 14:14:08

Modified files:
        Sigs           : article.rst 

Log message:
        notation

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/Sigs/article.rst.diff?tr1=1.38&tr2=1.39&r1=text&r2=text

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.38 manuscripts/Sigs/article.rst:1.39
--- manuscripts/Sigs/article.rst:1.38   Sat May 17 14:11:46 2003
+++ manuscripts/Sigs/article.rst        Sat May 17 14:14:08 2003
@@ -124,7 +124,7 @@
 One-time Signature Key Boosting
 ===============================
 
-This scheme is based on two primitives: 1) A `$k$`-time-signature
+This scheme is based on two primitives: 1) A `$q$`-time-signature
 algorithm which takes a random number as its private key, and 
 2) a random oracle which generates an apparently random
 bitstring from a given number.
@@ -139,7 +139,7 @@
 private key.
 Then, we iterate over the following steps `$N$` times:
 
-1. Choose `$x \\in [1,k]$`. The exact algorithm for making this
+1. Choose `$x \\in [1,q]$`. The exact algorithm for making this
    choice parametrizes the algorithm; possible choices are discussed
    below.
 
@@ -148,9 +148,9 @@
 
 3. Sign the corresponding public key with `$p$`. This does
    not present
-   a problem for the `$k$`-time signature algorithm, since
+   a problem for the `$q$`-time signature algorithm, since
    the random oracle is deterministic and
-   no more than `$k$` strings will therefore be signed
+   no more than `$q$` strings will therefore be signed
    with any given `$p$`.
 
 4.  `$p \\leftarrow p_x$`
@@ -165,7 +165,7 @@
 
 As long as the algorithm for choosing `$x$` does not yield the same
 chain for two messages, the signatures XXX
-The effects of this algorithm and the parameters `$k$` and `$N$`
+The effects of this algorithm and the parameters `$q$` and `$N$`
 are analyzed in the next section.
 
 




reply via email to

[Prev in Thread] Current Thread [Next in Thread]