[Gzz-commits] manuscripts/Sigs article.rst

[Tuomas J. Lukka]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Tuomas J. Lukka <address@hidden>        03/05/19 17:30:34

Modified files:
        Sigs           : article.rst 

Log message:
        twids

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.142 manuscripts/Sigs/article.rst:1.143
--- manuscripts/Sigs/article.rst:1.142  Mon May 19 17:29:25 2003
+++ manuscripts/Sigs/article.rst        Mon May 19 17:30:34 2003
@@ -209,15 +209,18 @@
 In this Section, we describe our central theoretical result:
 a feasible scheme for general 160-bit digital signatures.
 Our scheme has no time limits for private keys
-because it is not based on complexity of inverting trapdoor functions.
-The scheme requires only that one-way functions and random oracles exist.
+because its security
+is not based on complexity of inverting trapdoor functions;
+the scheme requires only that one-way functions and 
+random oracles exist.
+
 To our knowledge, this is has not previously been possible without
 remembering all previously signed documents or changing to a new
 private key after a given number of signatures.
 Our scheme only requires the private key to be remembered; no other
 state is required.
 
-In key boosting, the choise of the tree branch `$x$` to follow at each 
+In key boosting, the choice of the tree branch `$x$` to follow at each 
 node is crucial to the nature of the algorithm.
 In order to be able to sign 160-bit hashes securely, we generate
 a unique private key for each 160-bit hash.