[8384] in cryptography@c2.net mail archive
Re: Cryptographic Algorithm Metrics
daemon@ATHENA.MIT.EDU (Kris Kennaway)
Thu Jan 4 14:22:03 2001
Date: Thu, 4 Jan 2001 06:47:54 -0800
From: Kris Kennaway <kris@FreeBSD.org>
To: Paul Crowley <paul@cluefactory.org.uk>
Cc: Peter Fairbrother <peter.fairbrother@ntlworld.com>,
Greg Rose <ggr@qualcomm.com>, John Young <jya@pipeline.com>,
cryptography@c2.net
Message-ID: <20010104064754.B6982@citusc.usc.edu>
Mime-Version: 1.0
Content-Type: multipart/signed; micalg=pgp-md5;
protocol="application/pgp-signature"; boundary="uZ3hkaAS1mZxFaxD"
Content-Disposition: inline
In-Reply-To: <87y9wst8j1.fsf@hedonism.subnet.hedonism.cluefactory.org.uk>; from paul@cluefactory.org.uk on Thu, Jan 04, 2001 at 01:23:30AM +0000
--uZ3hkaAS1mZxFaxD
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
Content-Transfer-Encoding: quoted-printable
On Thu, Jan 04, 2001 at 01:23:30AM +0000, Paul Crowley wrote:
> Peter Fairbrother <peter.fairbrother@ntlworld.com> writes:
> > Not so. Perfect compression with encryption works too.
>=20
> Er, does it? I get a 1k message from you, perfectly compressed and
> then encrypted with some strong algorithm and a 128-bit key. As a
> godlike being unhindered by constraints of computational power, I try
> all 2^128 possible keys, and find due to the perfect compression that
> each of the 2^128 plaintexts is equally likely.
I think there's more that can be discovered here:
Decrypt the ciphertext with each possible key, and run it through the
perfect compression algorithm. If it compresses any more, then it's
not the plaintext since that is already perfectly compressed.
Kris
--uZ3hkaAS1mZxFaxD
Content-Type: application/pgp-signature
Content-Disposition: inline
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.0.4 (GNU/Linux)
Comment: For info see http://www.gnupg.org
iD8DBQE6VI0aWry0BWjoQKURAq6XAJ9sH/2Dsbmk7fY5F7RJtBAWgS3orgCgtdYG
YEm4Q7sEvsT0uRXALm9grQM=
=mjrh
-----END PGP SIGNATURE-----
--uZ3hkaAS1mZxFaxD--
