/[gzz]/manuscripts/Sigs/article.rst
ViewVC logotype

Diff of /manuscripts/Sigs/article.rst

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.58 by benja, Sat May 17 19:33:34 2003 UTC revision 1.59 by tjl, Sat May 17 19:35:32 2003 UTC
# Line 90  One-time Signatures Line 90  One-time Signatures
90      in schemes like DSA or RSA.      in schemes like DSA or RSA.
91    
92  One-time signature schemes [XXX] are based  One-time signature schemes [XXX] are based
93  on one-way functions [#]_.  on one-way functions, i.e., functions `$y=f(x)$` such
94    as block ciphers or cryptographic hashes so that
95    that given `$y$` it is infeasible to find `$x$`.
96  Given a one-way function f, the signer generates a set  Given a one-way function f, the signer generates a set
97  of (pseudo)random numbers and and publishes f(x) for each  of (pseudo)random numbers and and publishes f(x) for each
98  x in the set. This is the public key. To sign a message,  x in the set. This is the public key. To sign a message,
# Line 102  resultant set of numbers has been publis Line 104  resultant set of numbers has been publis
104  f(x) for each published number x against the values  f(x) for each published number x against the values
105  in the public key.  in the public key.
106    
 .. [#] 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.  
   
107  To prevent an attacker from using a subset of the  To prevent an attacker from using a subset of the
108  published numbers to sign a different message,  published numbers to sign a different message,
109  the deterministic algorithm is chosen so that no set  the deterministic algorithm is chosen so that no set

Legend:
Removed from v.1.58  
changed lines
  Added in v.1.59

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26