[Gzz-commits] manuscripts/Sigs article.rst

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/18 16:30:44

Modified files:
        Sigs           : article.rst 

Log message:
        choices

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.102 manuscripts/Sigs/article.rst:1.103
--- manuscripts/Sigs/article.rst:1.102  Sun May 18 16:29:43 2003
+++ manuscripts/Sigs/article.rst        Sun May 18 16:30:44 2003
@@ -623,19 +623,23 @@
   - Reyzin subset-resilient. The security requirement, 
     for a single signature signing 160 bits, this means that 
     `$\\log t \ge {160-\log k \over k}$`.
-    A suitable choise seems to be 
+    The choice with smallest `$t+k$` and (with less priority)
+    `$t$` is XXX SMALLEST K?
     `$t=308$`, `$k=91$`
+    `$t=316$`, `$k=83$`
 
-  - Reyzin pure. Here, we only need the ability to sign 160 bits,
+  - Reyzin pure. 
+    the Reyzin theoretical construction may be used,
+    where the time spent is somewhat more but security depends
+    only on hashes
+    Here, we only need the ability to sign 160 bits,
     which we get at the cheapest (where sum of bits
     in signature plus public key is smallest, and
     with smallest `$t$` at 
     `$t=168$`, `$k=69$`
+    `$t=175$`, `$k=62$`
 
-  - alternatively, the Reyzin theoretical construction may be used,
-    where the time spent is somewhat more but security depends
-    only on hashes
-
+  - Bleichenbacher-Maurer. 
 
 
 Conclusion