1994-06-22 - Re: something I’ve always wondered

Header Data

From: wcs@anchor.ho.att.com (bill.stewart@pleasantonca.ncr.com +1-510-484-6204)
To: cypherpunks@toad.com
Message Hash: 17d623b29d5eeb0aba1b9d302f3a4fb91b94160f2c81a99cdcf218c80eba8f41
Message ID: <9406221712.AA27812@anchor.ho.att.com>
Reply To: N/A
UTC Datetime: 1994-06-22 17:15:10 UTC
Raw Date: Wed, 22 Jun 94 10:15:10 PDT

Raw message

From: wcs@anchor.ho.att.com (bill.stewart@pleasantonca.ncr.com +1-510-484-6204)
Date: Wed, 22 Jun 94 10:15:10 PDT
To: cypherpunks@toad.com
Subject: Re: something I've always wondered
Message-ID: <9406221712.AA27812@anchor.ho.att.com>
MIME-Version: 1.0
Content-Type: text/plain

> Jim Miller says:
> > Does DES (or name your favorite encryption algorithm) produce as output  
> > all possible cyphertexts of length L, given all possible conbinations of  
> > keys and plaintexts of length L?

As Perry points out, for any key, cycling through the 2**64 inputs
will produce all 2**64 outputs.  On the other hand, there are
(2**64)! mappings of the set of inputs to the set of outputs,
and DES only uses 2**56 of those mappings, so there are probably
values of P and C for which there is no key K such that C = DES(P,K).