|
|
1.1 root 1: .TH ENCRYPT 1
2: .SH NAME
3: encrypt, decrypt \- encrypt or decrypt a message or file
4: .SH SYNOPSIS
5: .B encrypt
6: [
7: .B \-p
8: ]
9: [ password ]
10: .br
11: .B decrypt
12: [
13: .B \-p
14: ]
15: [ password ]
16: .SH DESCRIPTION
17: .I Encrypt
18: (
19: .I decrypt
20: )
21: reads from the standard input and writes
22: on the standard output.
23: The
24: .I password
25: is a key, up to 127 characters in length, which selects a particular transformation.
26: If no
27: .I password
28: is given,
29: .I encrypt
30: demands a key from the terminal (without echoing what the user types).
31: If the wrong key is given to decrypt, it will usually exit without
32: writing on standard output.
33: .PP
34: If the
35: .B \-p
36: option is specified, the ciphertext will be encoded into printing
37: characters only; suitable for sending through mail.
38: In this mode,
39: .B decrypt
40: ignores any lines that do not have a special prefix (added by
41: .B encrypt
42: ),
43: so messages received in the mail can be read without having to edit
44: out headers.
45: .PP
46: Encryption takes place in three layers. The first addresses traffic
47: analysis threats by hiding the size of the message and insuring that
48: if the same message is send repeatedly with the same
49: .I password
50: the ciphertext will be entirely different each time.
51: The second layer is the proposed Data Encryption Standard (DES) used
52: in Cipher Block Chaining (CBC) mode. Finally, a key-dependent character
53: transposition is applied to the ciphertext which impedes the
54: assembly of corresponding pairs of DES blocks under a known-plaintext attack.
55: .PP
56: The user is encouraged to use a lengthy password. A short sequence of
57: words chosen at random from a dictionary and committed to memory is
58: a good plan.
59: .SH FILES
60: /dev/tty for typed key
61: .SH AUTHOR
62: D.P.Mitchell
63: .SH BUGS
64: This encryption program is not provably secure, and the author gives no
65: guarantee that it cannot be broken.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.