[Gzz-commits] manuscripts/Sigs article.rst

[Benja Fallenstein]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Benja Fallenstein <address@hidden>      03/05/18 13:40:53

Modified files:
        Sigs           : article.rst 

Log message:
        org

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.86 manuscripts/Sigs/article.rst:1.87
--- manuscripts/Sigs/article.rst:1.86   Sun May 18 13:34:04 2003
+++ manuscripts/Sigs/article.rst        Sun May 18 13:40:53 2003
@@ -97,7 +97,7 @@
 on one-way functions, i.e., functions `$y=f(x)$` such
 as block ciphers or cryptographic hashes so that
 that given `$y$` it is infeasible to find `$x$`.
-Given a one-way function f, the signer generates a set
+Generally, given a one-way function f, the signer generates a set
 of (pseudo)random numbers and and publishes `$f(x)$` for each
 `$x$` in the set. This is the public key. To sign a message,
 the signer employs a deterministic algorithm to select
@@ -135,8 +135,9 @@
 still needs to keep track of which private keys
 have already been used in order not to compromise security.
 
-XXX Following descriptions not into article, maybe into tech report?
-We need these to make sure our numbers are right
+In section XXX, we give a description of existing
+one-time signature algorithms with their different
+tradeoffs.
 
 One-time Signature Key Boosting
 ===============================
@@ -557,6 +558,16 @@
 
 - verify: verify signature with new public key, verify hash chain.
 
+
+Efficiency of key boosting
+==========================
+
+- general analysis as appears in table
+
+- given different choices for the underlying scheme,
+  and for choosing x
+
+- maybe recommendations
 
 
 Conclusion