5 \h'-\w'\fB\\$1\ \fP'u'\fB\\$1\ \fP\c
32 .TH tripe-mitm 8 "14 October 2003" "Straylight/Edgeware" "TrIPE: Trivial IP Encryption"
34 tripe-mitm \- malicious proxy for TrIPE
47 Its purpose is to test the robustness of the TrIPE implementation, by
48 deliberately introducing communication problems such as dropped,
49 repeated or corrupted packets.
51 The command line contains a sequence of directives, each of which has
55 A list of directives can be stored in a file, one per line, and included
59 .SS "Command line options"
60 The following options are recognized.
63 Write a very brief help message to standard output, and exit
67 Write the program's version number to standard output, and exit
71 Write a usage message to standard output, and exit successfully.
73 .BI "\-k, \-\-keyring=" file
76 The default keyring file is
78 in the current directory.
80 A directive is ignored if it is empty, or if its first character is a
82 The following directives are recognized.
84 .BI peer: name : local-port : remote-addr : remote-port
85 Register a peer. We listen for packets on
93 identifies the public key which that peer uses to authenticate itself.
100 may be a hostname or an IP address in dotted-quad format. Exactly two
102 directives must be present. The one first registered is the
104 peer; the second is the
106 peer. The two peers must use
111 Read more directives from
113 Directives should appear one per line. Empty lines and comments are
114 permitted. An included file may include other files. It may even
115 include itself, though this is just a good way to tie the program in
116 knots until it runs out of file handles.
118 .BI filt: filter : args : \fR...
119 Apply a given filter to packets received from either peer. See the
120 description of filters below for more details.
122 .BI lfilt: filter : args : \fR...
123 Apply a given filter to packets received from the left peer.
125 .BI lfilt: filter : args :\fR...
126 Apply a given filter to packets received from the right peer.
128 .BI next: tag :\fR...
129 Begin the next branch of the first fork filter node named
131 in each filter chain. See below for more about filter chains.
133 .BI flood\fR[\fP: type : millis : size\fR]
134 Flood both peers with random packets. If
136 is given, it is interpreted as a TrIPE message type code in hexadecimal,
137 and the messages sent will have this type; otherwise the messages have
138 random type. Messages are sent approximately once every
140 milliseconds; the default interval is 10 milliseconds. The messages
143 bytes long each; the default size is 128 bytes.
145 .BI lflood\fR[\fP: type : millis : size\fR]
148 above, but only flood the left peer.
150 .BI rflood\fR[\fP: type : millis : size\fR]
153 above, but only flood the right peer.
155 Each peer has a filter chain associated with it. Messages received from
156 that peer get processed by the filter chain. Only if the filter chain
157 decides to send the message is it actually sent. (See the
159 filter, described below.)
160 Messages generated by a
162 directive (above) are also processed by a filter chain, just like normal
163 messages. The filters in a chain are processed in the order they were
166 The filters currently supported are as follows.
169 Send the message to the destination peer. This is the
171 way messages are sent. If your filter chains don't end in a
173 filter then nothing will get through!
176 Introduce a fork in a filter chain. A fork may have multiple branches
177 leading off it. The end of a branch is indicated by a
179 directive which names the fork
181 further filters added to the chain form a new parallel branch of that
182 fork. (If there are two forks with the same tag on a peer's chain, then
183 only the earliest is matched. This isn't helpful behaviour.)
185 .BI delay: qlen \fR[\fP: millis : p-replay\fR]
186 Delay, replay and reorder messages. A queue of
188 messages is maintained. If the queue fills up, or every
190 milliseconds (default 100), a message from the queue is chosen at random
191 and transmitted (i.e., processed by the rest of the filter chain). If
192 the message was transmitted due to a timer (rather than lack of space in
193 the queue) then it has a 1 in
195 probability (default 1 in 20) of being left in the queue.
197 .BI corrupt\fR[\fP: p-corrupt\fR]
198 Randomly corrupt messages. Each message has a 1 in
200 probability (default 1 in 5) of being corrupted by having a
201 randomly chosen byte mangled. The message might be further corrupted,
206 The parser is currently very primitive, and error handling is rather
207 poor. There are lots of pointless restrictions which wouldn't take very
208 long to fix. The program generally lacks polish. The program doesn't
209 understand the TrIPE protocol to a sufficient extent to really attack it
214 Mark Wooding, <mdw@nsict.org>