Article View: sci.crypt
Article #1154Re: More on cracking DES algorithm
From: Eli Brandt
Date: Thu, 01 Oct 1992 04:04
Date: Thu, 01 Oct 1992 04:04
15 lines
1121 bytes
1121 bytes
In article <BvExML.Juq@usenet.ucs.indiana.edu> shulick@yankton.ucs.indiana.edu writes: >Let's say someone retreives the DES source code, which is easy enough. Why >WOULDN'T they be able to take every single mathematical operation, reverse each >one, and then have a "decrypt()"? It's been done. In fact, it will probably come with the DES source. It may even be called "decrypt()"! Problem is, it requires a key... DES is entirely reversible if you have the key, but not very reversible otherwise; it would be a rather useless system otherwise. >Sam Hulick Eli ebrandt@jarthur.claremont.edu
Technical Details
Message-ID:
<1992Oct1.040458.8159@muddcs.claremont.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sdd.hp.com!swrinde!elroy.jpl.nasa.gov!news.claremont.edu!jarthur.claremont.edu!ebrandtReferences:
<BvExML.Juq@usenet.ucs.indiana.edu>Show Full Headers
Complete Article Headers
Newsgroups: sci.crypt Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sdd.hp.com!swrinde!elroy.jpl.nasa.gov!news.claremont.edu!jarthur.claremont.edu!ebrandt From: ebrandt@jarthur.claremont.edu (Eli Brandt) Subject: Re: More on cracking DES algorithm Message-ID: <1992Oct1.040458.8159@muddcs.claremont.edu> Sender: news@muddcs.claremont.edu (The News System) Organization: Harvey Mudd College, Claremont, CA 91711 References: <BvExML.Juq@usenet.ucs.indiana.edu> Date: Thu, 1 Oct 1992 04:04:58 GMT Lines: 15