thsutton at utas.edu.au
Tue Jan 6 03:52:28 PST 2004
On Tue, 2004-01-06 at 22:42, 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?
One of those two person key/password combo things to unlock a launch
capability or some such?
Probably not for large amount of data, i.e. amounts measured in bytes
More information about the hlfs-dev