Security criteria

Tobias Lang phobia at gmx.at
Tue Jan 6 03:56:07 PST 2004


On Tue, 6 Jan 2004 04:42:00 -0700
ken_i_m at elegantinnovations.net wrote:

> On Tue, Jan 06, 2004 at 11:03:36AM +0000, Andy Bennett (andyjpb at ashurst.eu.org) wrote:
> > An example of a mathematically unbreakable code is one where the key is 
> > the same length as the data being encrypted.
> 
> And such a system would be useful how?

This are "One-Time-Pads" and as far as I know the only pratical use is  real
secure key transportation.
However, the main goal is to proof, that secure encryption is possible. Its
more a proof of concept than a pratical invention.


----------------
Registered LFS User #7599  --- http://www.linuxfromscratch.org

Cultivate your addiction: http://www.tldp.org/HOWTO/Coffee.html
----------------
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: not available
URL: <http://lists.linuxfromscratch.org/pipermail/hlfs-dev/attachments/20040106/33d758f6/attachment.sig>


More information about the hlfs-dev mailing list