Subject: | |
From: | |
Reply To: | James B. Byrne |
Date: | Tue, 14 Feb 2006 10:38:09 -0500 |
Content-Type: | text/plain |
Parts/Attachments: |
|
|
On Mon, 13 Feb 2006 18:16:20 EST, Wirt Atmar <[log in to unmask]> wrote:
> ...by far the easiest thing to do is to use an XOR encryption
> procedure...
>
> If you adopt this algorithm, all you need do is never let anyone
> know the encrypting string. If you don't share that string, it's
> a pretty tough little procedure to defeat -- so long as you don't
> use a common phrase to encrypt your data with.
There are some important caveats. The most important is that the
key length be comparatively large with respect to the size of the
target data, 100% is ideal, > 50% desirable, < 30% problematic, <
10% weak; and that you only ever use a given key exactly once.
These are the essential characteristics of the one-time-pad
encryption method. The critical problem of encryption is non-
compromised key transfer between origin and destination, which is
what public key encryption systems are all about.
Regards,
Jim
--
*** e-mail is not a secure channel ***
mailto:byrnejb.<token>@harte-lyne.ca
James B. Byrne Harte & Lyne Limited
vox: +1 905 561 1241 9 Brockley Drive
fax: +1 905 561 0757 Hamilton, Ontario
<token> = hal Canada L8E 3C3
* To join/leave the list, search archives, change list settings, *
* etc., please visit http://raven.utc.edu/archives/hp3000-l.html *
|
|
|