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: Tuomas J. Lukka
Subject: [Gzz-commits] manuscripts/Sigs article.rst
Date: Sat, 17 May 2003 15:35:32 -0400

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

Modified files:
        Sigs           : article.rst 

Log message:
        nofoot

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.58 manuscripts/Sigs/article.rst:1.59
--- manuscripts/Sigs/article.rst:1.58   Sat May 17 15:33:34 2003
+++ manuscripts/Sigs/article.rst        Sat May 17 15:35:32 2003
@@ -90,7 +90,9 @@
     in schemes like DSA or RSA.
 
 One-time signature schemes [XXX] are based 
-on one-way functions [#]_.
+on one-way functions, i.e., functions `$y=f(x)$` such
+as block ciphers or cryptographic hashes so that
+that given `$y$` it is infeasible to find `$x$`.
 Given a one-way function f, the signer generates a set
 of (pseudo)random numbers and and publishes f(x) for each
 x in the set. This is the public key. To sign a message,
@@ -101,10 +103,6 @@
 resultant set of numbers has been published, and comparing
 f(x) for each published number x against the values
 in the public key.
-
-.. [#] A function f is one-way if it is infeasible, for
-   a given y, to find x so that y=f(x). Common examples
-   are block ciphers and cryptographic hash functions.
 
 To prevent an attacker from using a subset of the
 published numbers to sign a different message,




reply via email to

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