server/admin.c: Remove spurious `ping' in usage message.

[tripe] / doc / protocol.ms

diff --git a/doc/protocol.ms b/doc/protocol.ms
index 849a6622486cdffb72f7d3dbc5c0e330ceed6ebe..151ef91dbc45e17ac755634bececaf42425ca67a 100644 (file)
--- a/doc/protocol.ms
+++ b/doc/protocol.ms
@@ -1,9 +1,9 @@
 .\" -*-nroff-*-
 .so tmac.rfc
 .
-.TL "Straylight/Edgeware"               "Mark Wooding"
-.TL "Request for Comments:  XXXX"       "Straylight/Edgeware"
-.TL ""                                  "11 April 2003"
+.TL "Straylight/Edgeware"              "Mark Wooding"
+.TL "Request for Comments:  XXXX"      "Straylight/Edgeware"
+.TL ""                                 "11 April 2003"
 .
 .TT XXXX Wooding "April 2003" \
   "TrIPE: The Trivial IP Encryption Protocol"
@@ -52,7 +52,7 @@ registered for TrIPE yet.
 .P
 When a pair of peer hosts are made aware of each other, they begin a key
 negotiation, using an authenticated Diffie-Hellman key exchange
-protocol.  This enables them to agree a 
+protocol.  This enables them to agree a
 .I keyset :
 a collection of short-term symmetric keys and other parameters (such as
 sequence numbering spaces).  Keysets expire after a fixed amount of
@@ -91,7 +91,7 @@ and
 .B "\\$1" \c
 .if !'\\$2'.' \ \\$2\c
 .if !'\\$3'' \{\
-: 
+:
 .I "\\$3" \c
 .\}
 ..
@@ -106,7 +106,7 @@ and
 .LS 2n
 ..
 .P
-We need to deal with a number of data items during the protocol.  
+We need to deal with a number of data items during the protocol.
 .if t \{\
 Object names are given in
 .I italics .
@@ -117,7 +117,7 @@ indicates the peer's corresponding value.  If a compound data item name
 is primed, toggle the primed-ness of the components.
 .P
 Data objects are given types which determine their representation in
-protocol messages.  Type names are given in 
+protocol messages.  Type names are given in
 .B UPPERCASE .
 .P
 .T1 "Atomic data items"
@@ -144,12 +144,12 @@ be the integer to be represented, and let
 be the number of octets required to represent
 .I n
 in base-256 format with no leading zeroes, except that if
-.I n 
+.I n
 = 0
-then 
+then
 .I z
 = 1; in other cases,
-.I z 
+.I z
 is the unique integer such that
 .ie t 256\*(^(\fIz\fP\-1\*(^) \(<= \fIn\fP < 256\*(^(\fIz\fP\*(^).
 .el 256^{z-1} <= n < 256^z.