most U.S. telecoms communications and all Internet traffic. The NSA used them to eavesdrop and order police investigations of tens of thousands of ordinary Americans without judicial warrants.

http://en.wikipedia.org/wiki/Canadian_Security_Intelligence_Service (Canada)

http://en.wikipedia.org/wiki/Communications_Security_Establishment (Canada,

Echelon links)

http://en.wikipedia.org/wiki/ECHELON (UK, global links)

http://en.wikipedia.org/wiki/Carnivore_%28FBI%29 (Global internet)

http://en.wikipedia.org/wiki/Magic_Lantern_%28software%29 (Global internet)

http://en.wikipedia.org/wiki/Total_Information_Awareness

http://en.wikipedia.org/wiki/Mass_surveillance (Global camera systems, links

to all surveilance systems)

http://en.wikipedia.org/wiki/NSA_call_database

http://en.wikipedia.org/wiki/RFID (Global radiowaves)

http://en.wikipedia.org/wiki/Numbers_station (Global radiowaves)

http://en.wikipedia.org/wiki/The_Conet_Project (Global radiowaves) *Hear

samples in next e-mail*

http://en.wikipedia.org/wiki/One-time_pad

http://en.wikipedia.org/wiki/Steganography

http://en.wikipedia.org/wiki/FreeOTFE (To help the common person)

http://en.wikipedia.org/wiki/Off-the-Record_Messaging (To help the common

person)

http://www.spammimic.com/ (To help the common person)

http://www.PGP.com (To help the common person - e-mail and file storage)

http://www.snapfiles.com/get/clipsecure.html (To help the common person -

text chat)

Something to always remember - "One time pad" description and example:

Suppose Alice wishes to send the message 'HELLO' to Bob. Assume two pads of paper containing identical random sequences of letters were somehow previously produced and securely issued to both. Alice chooses the appropriate unused page from the pad. The way to do this is normally

arranged for in advance, as for instance 'use the 12th sheet on Labor Day', or 'use the next available sheet for the next message'. The material on the selected sheet is the key for this message. Each letter from the pad will be combined in a predetermined way with one letter of the message. It is common, but not required, to assign each letter a numerical value: e.g., "A" is 0, "B" is 1, and so on through "Z", 25. In this example, the technique is to combine the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. If key material begins with,

X M C K L

and the message is "HELLO", then the coding would be done as follows:

23 (X) 12 (M) 2 (C) 10 (K) 11 (L) key

+ 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) message

= 30 16 13 21 25 key + message

= 4 (E) 16 (Q) 13 (N) 21 (V) 25 (Z) key + message (mod 26)

Note that if a number is larger than 25, then in modular arithmetic fashion, the remainder on division by 26 would be taken. This simply means that, if your computations "go past" Z, you start again at A.

The ciphertext to be sent to Bob is thus "EQNVZ." Bob uses the matching key

page and the same process, but in reverse, to obtain the plaintext. Here,

the key is subtracted from the ciphertext, again using modular arithmetic:

4 (E) 16 (Q) 13 (N) 21 (V) 25 (Z) ciphertext

- 23 (X) 12 (M) 2 (C) 10 (K) 11 (L) key

= -19 4 11 11 14 ciphertext - key

= 7 (H) 4 (E) 11 (L) 11 (L) 14 (O) ciphertext - key (mod 26)

Similar to above, if a number is negative, 26 is added to make the number

nonnegative.

Thus, Bob recovers Alice's plaintext, the message "HELLO". Both Alice and Bob destroy the key sheet immediately after use, thus preventing reuse and an attack against the cipher. The KGB often issued its agents one-time pads printed on tiny sheets of "flash paper"-paper chemically converted to nitrocellulose, which burns almost instantly and leaves no ash.

The classical one-time pad of espionage (which often required actual paper pads (often minuscule for ease of concealment), a sharp pencil and the use of some mental arithmetic) can be implemented as a software program using data files as input (plaintext) and output (ciphertext) and key material (the required random sequence). The XOR operation is often used to combine the plaintext and the key elements, and is especially attractive on computers since it is usually a native machine instruction and is therefore very fast. However, ensuring that the key material is actually random, is used only once, never becomes known to the opposition, and is completely destroyed after use is hard to do. The auxiliary parts of a software one-time pad implementation present real challenges: secure handling/transmission of plaintext, truly random keys, and one-time-only use of the key.