[12547] in cryptography@c2.net mail archive
Re: AES-128 keys unique for fixed plaintext/ciphertext pair?
daemon@ATHENA.MIT.EDU (Anton Stiglic)
Thu Feb 20 18:41:56 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
From: "Anton Stiglic" <astiglic@okiok.com>
To: "Ed Gerck" <egerck@nma.com>
Cc: <cryptography@wasabisystems.com>
Date: Wed, 19 Feb 2003 11:30:29 -0500
> The statement was for a plaintext/ciphertext pair, not for a random-bit/
> random-bit pair. Thus, if we model it terms of a bijection on random-bit
> pairs, we confuse the different statistics for plaintext, ciphertext, keys
and
> we include non-AES bijections.
While your reformulation of the problem is interesting, the initial question
was regarding plaintext/ciphertext pairs, which usually just refers to the
pair
of elements from {0,1}^n, {0,1}^n, where n is the block cipher length.
Think of encrypting n-bit keys....
If you just want to consider the plaintext set to be the subset consisting
of ASCII text in English you should specify so...
--Anton
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
