gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] manuscripts/Sigs article.rst


From: Benja Fallenstein
Subject: [Gzz-commits] manuscripts/Sigs article.rst
Date: Sun, 18 May 2003 16:27:58 -0400

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Benja Fallenstein <address@hidden>      03/05/18 16:27:58

Modified files:
        Sigs           : article.rst 

Log message:
        correct hash tree octuplet

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.100 manuscripts/Sigs/article.rst:1.101
--- manuscripts/Sigs/article.rst:1.100  Sun May 18 16:25:00 2003
+++ manuscripts/Sigs/article.rst        Sun May 18 16:27:58 2003
@@ -353,11 +353,11 @@
        % XXX check this again
        ($n, S'$) }
            & ${2^n}q'$ 
-               & $b$ & $2s'+r'+hn$ 
+               & $b$ & $s'+r'+hn+h$ 
                            & $h$ & $h$ & 
-                                       $({2^n}+1)c_0'+c_s' + 2^{n+1}-1$ & 
+                                       ${2^n}c_0' + 2(2^n)-1$ & 
                                                 $c_s'$ &
-                                                       $2c_v'+n$ \\
+                                                       $c_v'+n+1$ \\
        \parbox{\sw}{Key boosting $(N, S')$ }
            & ${q'}^N$ & $b$ & $N(r'+s')$ & $r'$ & $h$ &
                $c_0'$ & $N(c_0'+c_s')$ & $Nc_v$ \\
@@ -586,6 +586,9 @@
   `$2^n c_0$` and calculating the hash tree takes
   `$2^{n+1}-1$` hash function invocations.
 
+  The branches in the hash tree are stored for use
+  when signing.
+
 - sign using one key: Sign with that private key, provide the
   corresponding public key, and provide the chain of hashes
   from the hash tree's root to the public key.
@@ -593,8 +596,8 @@
 
 - verify: verify signature with new public key, verify hash chain.
 
-Octuplet: `$({2^n}q', b, 2s'+r'+hn, h, h, 
-({2^n}+1)c_0'+c_s' + 2^{n+1}-1, c_s', 2c_v'+n$`
+Octuplet: `$({2^n}q', b, s'+r'+hn+h, h, h, 
+{2^n}c_0' + 2(2^n)-1, c_s', c_v'+n+1$`
 
 Efficiency of key boosting
 ==========================




reply via email to

[Prev in Thread] Current Thread [Next in Thread]