[Gzz-commits] manuscripts/Sigs article.rst

[Tuomas J. Lukka]

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

Modified files:
        Sigs           : article.rst 

Log message:
        intro

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.55 manuscripts/Sigs/article.rst:1.56
--- manuscripts/Sigs/article.rst:1.55   Sat May 17 15:25:09 2003
+++ manuscripts/Sigs/article.rst        Sat May 17 15:29:59 2003
@@ -54,26 +54,20 @@
 their operation 
 does not
 rely on
-unproven number-theoretic assumptions, like the
+unproven number-theoretic assumptions such as the
 difficulty of factoring large integers [XXX]. 
-Also, in practice,
-a cryptographic hash function is used in most
-signature schemes anyway to map messages to a
-fixed-length digest, which is then signed. As
-cryptographic hash functions are one-way, also using them
-as the basis for signature avoids introducing additional
-cryptographic primitives into the system.
 
-Additionally, operations on one-way signatures
-may be orders of magnitude faster than operations
-in schemes like DSA or RSA.
+This is important for, e.g., long-term digital publishing
+where the usual recommended digital signature expiration 
+time of two years[XXX] is inconvenient.
+
 
-In this article, we introduce a new signature scheme
+In this article, we introduce a new signature scheme,
+based on one-time signatures and a random oracle,
 that can be used any number of times without keeping track
 of private keys that have already been used.
-Our scheme assumes a one-time signature scheme 
-and a random oracle. 
-In the following Sections, we first
+In the following Sections, we first 
+review one-time signatures, and subsequently
 describe our algorithm. 
 Then, we analyze the tradeoffs in it and other one-time signature
 schemes. 
@@ -83,6 +77,17 @@
 
 One-time Signatures
 ===================
+
+Also, in practice,
+a cryptographic hash function is used in most
+signature schemes anyway to map messages to a
+fixed-length digest, which is then signed. As
+cryptographic hash functions are one-way, also using them
+as the basis for signature avoids introducing additional
+cryptographic primitives into the system.
+Additionally, operations on one-way signatures
+may be orders of magnitude faster than operations
+in schemes like DSA or RSA.
 
 One-time signature schemes [XXX] are based 
 on one-way functions [#]_.