Security criteria

Ian Molton spyro at f2s.com
Tue Jan 6 09:09:39 PST 2004


On Tue, 06 Jan 2004 11:03:36 +0000
Andy Bennett <andyjpb at ashurst.eu.org> wrote:

> Encrypting only what is sensitive show attackers where to concentrate 
> their efforts. With mathematically unbreakable codes (which do exist) 
> any amount of data is unhelpful.

With a mathematically unbreakable code it doesnt matter if they know where to concentrate their efforts or not, either, does it?

Im not convinced a truely 'unbreakable' code exists anyhow.

> 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 ?


-- 
Spyros lair: http://www.mnementh.co.uk/   ||||   Maintainer: arm26 linux

Do not meddle in the affairs of Dragons, for you are tasty and good with ketchup.



More information about the hlfs-dev mailing list