1996-04-20 - Dictionary searching code
Header Data
From: Adam Shostack <adam@lighthouse.homeport.org>
To: cypherpunks@toad.com (Cypherpunks Mailing List)
Message Hash: f66d952b078d7582f6dc37bfcfedaa21f1a834df54af7ac4ae9430a78f631591
Message ID: <199604200102.UAA10156@homeport.org>
Reply To: N/A
UTC Datetime: 1996-04-20 05:54:02 UTC
Raw Date: Sat, 20 Apr 1996 13:54:02 +0800
Raw message
From: Adam Shostack <adam@lighthouse.homeport.org>
Date: Sat, 20 Apr 1996 13:54:02 +0800
To: cypherpunks@toad.com (Cypherpunks Mailing List)
Subject: Dictionary searching code
Message-ID: <199604200102.UAA10156@homeport.org>
MIME-Version: 1.0
Content-Type: text
Does anyone have some code that will search a dictionary, and
tell me *quickly* if an arbitrary chunk of text is in the dictionary?
Pre-indexing steps are fine, as is using big chunks of disk for hash
tables. The point of course, is to check arbitrary possible plaintext
that a test decryption produces.
Adam
--
"It is seldom that liberty of any kind is lost all at once."
-Hume
Thread
Return to April 1996
- Return to “Adam Shostack <adam@lighthouse.homeport.org>”
- Return to “Black Unicorn <unicorn@schloss.li>”
- Return to “Michael B Herf <herf+@CMU.EDU>”
Return to “Simon Spero <ses@tipper.oit.unc.edu>”
- 1996-04-20 (Sat, 20 Apr 1996 13:54:02 +0800) - Dictionary searching code - Adam Shostack <adam@lighthouse.homeport.org>
- 1996-04-20 (Sat, 20 Apr 1996 12:46:44 +0800) - Re: Dictionary searching code - Black Unicorn <unicorn@schloss.li>
- 1996-04-20 (Sat, 20 Apr 1996 15:55:02 +0800) - Re: Dictionary searching code - Simon Spero <ses@tipper.oit.unc.edu>
- 1996-04-20 (Sat, 20 Apr 1996 19:58:59 +0800) - Re: Dictionary searching code - Michael B Herf <herf+@CMU.EDU>