[Gzz-commits] manuscripts/Sigs article.rst birthday.bc

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/19 16:36:56

Modified files:
        Sigs           : article.rst birthday.bc 

Log message:
        abstrabirth

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/Sigs/article.rst.diff?tr1=1.131&tr2=1.132&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/Sigs/birthday.bc.diff?tr1=1.2&tr2=1.3&r1=text&r2=text

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.131 manuscripts/Sigs/article.rst:1.132
--- manuscripts/Sigs/article.rst:1.131  Mon May 19 16:08:55 2003
+++ manuscripts/Sigs/article.rst        Mon May 19 16:36:55 2003
@@ -35,8 +35,9 @@
 a 110 KB signature, 201'952 hash function invocations for signing, and 
 5'568 hash invocations for verification.
 On a more practical level, we discuss a 
-probabilistically valid instance with 56-bit security
-if only used for up to XXX signatures.
+probabilistically valid instance 
+which can be used for any number of signatures
+within the bounds of the 56-bit birthday paradox.
 The probabilistic scheme requires
 a 42 KB sig, 75'732 hash invocations for signing, and 2'088 hashes 
 for verification.
Index: manuscripts/Sigs/birthday.bc
diff -u manuscripts/Sigs/birthday.bc:1.2 manuscripts/Sigs/birthday.bc:1.3
--- manuscripts/Sigs/birthday.bc:1.2    Mon May 19 16:29:41 2003
+++ manuscripts/Sigs/birthday.bc        Mon May 19 16:36:55 2003
@@ -8,7 +8,7 @@
     return (( (n-k+0.5) * (l(n) - l(n-k)) - k));
     }
     
-for(k=20; k<30; k++) {
+for(k=15; k<30; k++) {
     b = birthday(2^56, 2^k); 
     print k, "   ", b, " conf ", 1-e(b), "\n";
 }