[Gzz-commits] manuscripts/Sigs article.rst

[Benja Fallenstein]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Changes by:     Benja Fallenstein <address@hidden>      03/05/18 11:58:13

Modified files:
        Sigs           : article.rst 

Log message:
        fix single backslashes

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

Patches:
Index: manuscripts/Sigs/article.rst
diff -u manuscripts/Sigs/article.rst:1.77 manuscripts/Sigs/article.rst:1.78
--- manuscripts/Sigs/article.rst:1.77   Sun May 18 10:58:15 2003
+++ manuscripts/Sigs/article.rst        Sun May 18 11:58:13 2003
@@ -96,8 +96,8 @@
 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,
+of (pseudo)random numbers and and publishes `$f(x)$` for each
+`$x$` in the set. This is the public key. To sign a message,
 the signer employs a deterministic algorithm to select
 a subset of the random numbers, and publishes them
 as the signature. The signature can be verified by running
@@ -214,7 +214,7 @@
 functions.
 
 To sign `$b$` bits, choose `$t$` and `$k$` such that
-`$ {t \choose k} \ge b $`
+`$ {t \\choose k} \\ge b $`
 
 Parameters `$t$` and `$k$`.
 
@@ -437,7 +437,7 @@
 
 In order to work, key boosting requires the
 hash tree as a basis to obtain an basis algorithm
-with `$q' \ne 1$`.
+with `$q' \\ne 1$`.
 
 The values for Bleichenbacher and Maurer's algorithm