[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:52:29

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.147&tr2=1.148&r1=text&r2=text

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.147 manuscripts/Sigs/article.rst:1.148
--- manuscripts/Sigs/article.rst:1.147  Mon May 19 17:47:45 2003
+++ manuscripts/Sigs/article.rst        Mon May 19 17:52:29 2003
@@ -279,7 +279,9 @@
 we obtain a signature scheme
 with 110.0KB signatures and `$2.1\cdot 10^{5}$`
 hash invocations for signing and `$5.6\cdot 10^3$` 
-hash invocations for verification.
+hash invocations for verification. 
+Using SHA-1, we obtained the estimated times 1s and 30ms
+for signing and verifying on a P4 Mobile 1.6GHz.
 
 ..  com
 
@@ -289,9 +291,6 @@
     ts=2.02e+05 [~1009.76ms], 
     tv=5.57e+03 [~27.84ms])
 
-- may be practical for some applications,
-  but no replacement in general
-
 The private keys in these schemes is only 160 bits long;
 the random oracle is used to generate all the other private keys.
 
@@ -373,9 +372,13 @@
 The downsides of the present scheme are that
 signatures are relatively large and signing
 and verifying require considerably more time
-than with other schemes. However, with modern
-computers storage space is cheap and the estimated
-signature times are not prohibitive. Additionally,
+than with other schemes. 
+While the presented instances of
+schemes are certainly feasible, and
+may be practical for some applications, 
+they are currently no replacement for normal digital signature
+algorithms.
+Additionally,
 considerable algorithmic improvements may be possible.
 
 Naturally, this scheme is not foolproof. Weaknesses in cryptographic