Security criteria

ken_i_m at ken_i_m at
Tue Jan 6 12:09:16 PST 2004

On Tue, Jan 06, 2004 at 05:09:39PM +0000, Ian Molton (spyro at wrote:
> On Tue, 06 Jan 2004 11:03:36 +0000 
> > An example of a mathematically unbreakable code is one where the key is 
> > the same length as the data being encrypted.
> yeah, and also totally useless for encrypting a harddisc - where are you going to generate 200GB of truely random entropy ?

Size is not the point.  Even if the file was 1k there is no point in using 
a 1k key to encrypt it.  It would be easier to simple memorize the file. 
Then tiny errors do not result in total data loss.

For folks who are still having trouble with these basic concepts please 
read "The Code Book" by Simon Singh.  It is a very easy, non-technical 
I think, therefore, ken_i_m
Chief Gadgeteer, Elegant Innovations
Founder, Bozeman Linux Users Group
(406) 581-0495

More information about the hlfs-dev mailing list