From: holland@CS.ColoState.EDU (douglas craig holland)
To: cypherpunks@toad.com
Message Hash: 287e5c7b297599f708b8de286fc61a71d9721af5d57d1b636aeb1bb7b2dc0b03
Message ID: <9310140009.AA06153@beethoven>
Reply To: N/A
UTC Datetime: 1993-10-14 00:10:01 UTC
Raw Date: Wed, 13 Oct 93 17:10:01 PDT
From: holland@CS.ColoState.EDU (douglas craig holland)
Date: Wed, 13 Oct 93 17:10:01 PDT
To: cypherpunks@toad.com
Subject: !FLAME: breaking DES
Message-ID: <9310140009.AA06153@beethoven>
MIME-Version: 1.0
Content-Type: text
OK, I sort of wanted to break up the constant flaming on this thread,
so I thought I would introduce my own (admittedly ignorant) way to break
DES.
1. Start with a full keysearch of all 2^56 possible DES keys.
2. If you have plaintext to work with, compare each sample
decryption with the plaintext.
2a. If you don't have plaintext, I would try washing the decryptions
through a pattern searching algorithm that would include a dictionary,
patterns from compression programs like PKZip, machine language instructions,
and any other possible form of communication that can be represented as
a binary string.
At least that's how I would do it. If anyone has any suggestions,
corrections, etc. I wouldn't mind hearing them.
Doug
Return to October 1993
Return to “holland@CS.ColoState.EDU (douglas craig holland)”
1993-10-14 (Wed, 13 Oct 93 17:10:01 PDT) - !FLAME: breaking DES - holland@CS.ColoState.EDU (douglas craig holland)