 |
 |
 |
 |
 |
 |
| The inspiration for Permanent Privacy came from the idea of encrypting a piece of plain text that was unintelligible gibberish. If the plain text is gibberish and has no meaning, there is no understandable form or relationship between the plain text and the cyphertext. So when you launch an attack on the cyphertext, and try all combinations of the key(s) in order to decrypt it, the plain text will certainly appear. The problem is that you will never know which of the perhaps billions of combinations is the plain text, as you have no way to judge this. When no plain text can be squeezed from the cyphertext, from a probability point of view (zero probability) an un-breakable system has been achieved. This argument has been extended further and applied to meaningful plain text in order to produce a practical and truly un-breakable encryption system: Permanent Privacy, or PP (Patent Pending). For example, suppose that the plain text message is simply one 5-letter word. At first glance, you would think that this must be easy to break. But there are, let us say, about 100 printable characters on a computer keyboard, so there are some 100x100x100x100x100 ways of producing a 5-letter word. This means that there are about 10 billion different possible 5-letter words, including every 5-letter word in every language plus every permutation of numerals and gibberish. A brute-force attack on PP's cyphertext would produce ALL of them (plus every 4-, 3- and 2-letter word) and there is no way of knowing which word is the original plain text unless you have the keys. Similarly, if you encrypt a page of text, a brute-force attack will produce (apart from trillions of gibberish pages) every single page of text that has ever been written. |
