Article View: sci.crypt
Article #2420Re: Enlarging key size of the DES algorithm
From: Joseph Reuter
Date: Fri, 18 Dec 1992 16:50
Date: Fri, 18 Dec 1992 16:50
10 lines
1146 bytes
1146 bytes
The differential analysis results suggest to me that the DES transformations divide into approximately 2^47 equivalence classes. It does not seem at all obvious to me that using the S-box bits as a key would produce a system with 2^768 distinct equivalence classes. It does no good at all to have an enormous key space if many keys produce the same transformation. -- Joseph A. Reuter, Wizard-in-Training Speaking for myself from reuter@venice.sedd.trw.com "Olorin I was in my youth in the West that is forgotten." -- J.R.R. Tolkien "You can't win, you can't break even, and it's the only game in town."
Technical Details
Message-ID:
<1992Dec18.165012.10151@venice.sedd.trw.com>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!usc!venice!reuterReferences:
<6681@tuegate.tue.nl> <BzDp6F.6zn@chinet.chi.il.us> <1992Dec17.205145.10511@watson.ibm.com>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!usc!venice!reuter From: reuter@venice.sedd.trw.com (Joseph Reuter) Subject: Re: Enlarging key size of the DES algorithm Message-ID: <1992Dec18.165012.10151@venice.sedd.trw.com> Keywords: DES, key size Sender: Joseph A. Reuter Organization: TRW Systems Engineering & Development Division, Carson, CA References: <6681@tuegate.tue.nl> <BzDp6F.6zn@chinet.chi.il.us> <1992Dec17.205145.10511@watson.ibm.com> Date: Fri, 18 Dec 1992 16:50:12 GMT Lines: 10