A proper law

[Philip Perry]

Any repeating algorithm can, eventually, be defeated.  Either by brute force
(esp. quantum computing techniques), by anticipating user dullness (e.g.
encrypting compressed files which have known headers, trailers, and
checksums), or by human intelligence (e.g. spies).

One pass pads, especially if combined with stenanography, is much more
difficult.

Regards,

Phil Perry

philip.f.perry@btopenworld.com

----- Original Message -----
From: "Ian G Batten" <I.G.Batten@ftel.co.uk>
To: <ukcrypto@chiark.greenend.org.uk>
Sent: Wednesday, March 05, 2003 5:22 PM
Subject: Re: A proper law


> On Wed, 05 Mar 2003, David Hansen wrote:
> > keys to be grabbed. If a communication is really that important
> > encryption can be broken by massive computer power. The sky is not
>
> Untrue.  If you can suggest a brute force attack on 3DES or AES which
> will work in the lifetime of the universe without converting its entire
> mass into computer, please let us know.  And that's before we consider
> one time pads.
>
> ian
>
>
>
>