[Gzz-commits] manuscripts/Sigs article.rst poss.py

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/19 09:18:32

Modified files:
        Sigs           : article.rst poss.py 

Log message:
        linears

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/Sigs/article.rst.diff?tr1=1.105&tr2=1.106&r1=text&r2=text
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/Sigs/poss.py.diff?tr1=1.9&tr2=1.10&r1=text&r2=text

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.105 manuscripts/Sigs/article.rst:1.106
--- manuscripts/Sigs/article.rst:1.105  Mon May 19 07:47:04 2003
+++ manuscripts/Sigs/article.rst        Mon May 19 09:18:32 2003
@@ -665,6 +665,29 @@
 Tradeoffs in deterministic key boosting
 ---------------------------------------
 
+Supporting multiple signatures is possible e.g. in BiBa,
+but inefficient. Merkle hash trees better
+
+we want the full deterministic
+algorithm, 
+that, which requires `$ nN = 160 $`
+
+2, 80
+3, 54
+4, 40
+5, 32
+6, 27
+7, 23
+8, 20
+9, 18
+10, 16
+11, 15
+12, 14
+13, 13
+...
+
+
+
 
 - we demand security level `$2^{-160}$` for our underlying schemes
 
Index: manuscripts/Sigs/poss.py
diff -u manuscripts/Sigs/poss.py:1.9 manuscripts/Sigs/poss.py:1.10
--- manuscripts/Sigs/poss.py:1.9        Mon May 19 07:47:04 2003
+++ manuscripts/Sigs/poss.py    Mon May 19 09:18:32 2003
@@ -85,7 +85,73 @@
        printscheme(s)
     schemes.append((n,s))
 
+# Integers whose products >= 160
+tks =  (
+(2, 80),
+(3, 54),
+(4, 40),
+(5, 32),
+(6, 27),
+(7, 23),
+(8, 20),
+(9, 18),
+(10, 16),
+(11, 15),
+(12, 14),
+(13, 13),
+(14, 12),
+(15, 11),
+(16, 10),
+(18, 9),
+(20, 8),
+(23, 7),
+(27, 6),
+(32, 5),
+(40, 4),
+(54, 3),
+(80, 2),
+)
+
 if __name__ == '__main__':
+
+    if 1:
+
+       def pzip(names, arrs):
+           res = []
+           for i in range(0, len(arrs[0])):
+               res.append(" + ".join([
+                       "%s %s" % (arrs[name][i], names[name])
+                   for name in range(0, len(names))
+                       if arrs[name][i] != 0]))
+           return res
+       
+       for N,n in tks:
+           ss = key_boosting(N,
+            merkle_hashtree(n,
+             (0, 0, 1, 0, 0, 0, 0, 0)))
+           sr = key_boosting(N,
+            merkle_hashtree(n,
+             (0, 0, 0, 1, 0, 0, 0, 0)))
+           sh = key_boosting(N,
+            merkle_hashtree(n,
+             (0, 0, 0, 0, 1, 0, 0, 0)))
+           sc0 = key_boosting(N,
+            merkle_hashtree(n,
+             (0, 0, 0, 0, 0, 1, 0, 0)))
+           scs = key_boosting(N,
+            merkle_hashtree(n,
+             (0, 0, 0, 0, 0, 0, 1, 0)))
+           scv = key_boosting(N,
+            merkle_hashtree(n,
+             (0, 0, 0, 0, 0, 0, 0, 1)))
+           print "\n\n",N,n
+           print "S,R:", pzip(("s'", "r'", "h'"), (ss, sr, sh)) [2:4]
+           print "C0,Cs,Cv:", pzip(("C0'", "Cs'", "Cv'"), (sc0, scs, scv)) [5:]
+
+
+
+       exit(0)
+
     ts = []
     ts.extend(range(1, 50))
     ts.append(80)