From: attila <attila@primenet.com>
To: Adam Shostack <adam@lighthouse.homeport.org>
Message Hash: e320b740f1b117a5d911f1608a86de17afa7c9e7c6969695b544a9f646755091
Message ID: <199604200410.VAA21173@usr2.primenet.com>
Reply To: N/A
UTC Datetime: 1996-04-20 06:47:50 UTC
Raw Date: Sat, 20 Apr 1996 14:47:50 +0800
From: attila <attila@primenet.com>
Date: Sat, 20 Apr 1996 14:47:50 +0800
To: Adam Shostack <adam@lighthouse.homeport.org>
Subject: Re: Dictionary searching code
Message-ID: <199604200410.VAA21173@usr2.primenet.com>
MIME-Version: 1.0
Content-Type: text/plain
** Reply to note from Adam Shostack <adam@lighthouse.homeport.org> 04/19/96 8:02pm -0500
=
=
= 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.
=
for this purpose, the OLD unix code starting with V6 20 years ago has a speller with
a fairly comprehensive dictionary. The code is small. about 15 years ago I broke it out and
rewrote it as linkable libraries to handle multiple dictionaries. I know I have the code
somewhere --probably on MIPS 2000 tape or Sun 3 tape... the code also contains excellent
prefix/suffix codes, etc. I do not remember spending a great deal of time doing the
conversion, and it was straighforward to convert it to a callable library (or even a .dll).
attila
--
Obscenity is a crutch for inarticulate motherfuckers.
Fuck the CDA!
cc: Cypherpunks <cypherpunks@toad.com>
Return to April 1996
Return to “attila <attila@primenet.com>”
1996-04-20 (Sat, 20 Apr 1996 14:47:50 +0800) - Re: Dictionary searching code - attila <attila@primenet.com>