[Gzz-commits] manuscripts/Sigs article.rst

[Tuomas J. Lukka]

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

Modified files:
        Sigs           : article.rst 

Log message:
        struct

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.39 manuscripts/Sigs/article.rst:1.40
--- manuscripts/Sigs/article.rst:1.39   Sat May 17 14:14:08 2003
+++ manuscripts/Sigs/article.rst        Sat May 17 14:21:33 2003
@@ -239,8 +239,7 @@
     }
     \end{table*}
 
-Effect of boosting
-------------------
+Table XXX
 
 There are three parameters to the one-time signature key boosting algorithm:
 `$N$`, the number of levels in the private key tree,
@@ -250,6 +249,8 @@
 - given `$N$` and `$k$`, there are `$k^N$` 
   possible private keys for signing messages.
 
+- We map
+
 - alternatives at tree nodes:
 
   - sign each public key separately,  requires `$b \\ge r$` and `$q\\ge k$`
@@ -276,8 +277,13 @@
 - the first levels of signatures may be given in the public key,
   giving a tradeoff between public key size and signature size.
 
+Variants: Choosing the Tree Branch
+==================================
+
 Choice of `$x$`
----------------
+
+Deterministic: a Full Digital Signature Algorithm Feature Set
+-------------------------------------------------------------
 
 - Arbitrary (pseudo-infinite, i.e. infinite wouldn't help any more) 
   number of keys, if for each *hash* its own private key for signing it!
@@ -287,6 +293,11 @@
       without trapdoors
 
     - realistic? How much does this need?
+
+Random or deterministic, but probabilistic
+------------------------------------------
+
+Shorter signatures
 
 - If less, cannot use information from hash directly, otherwise can attack
   by giving close relatives