<?xml version="1.0" encoding="utf-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: md5 lookups for 4 chars and common words</title>
	<atom:link href="http://www.outflux.net/blog/archives/2008/11/18/md5_lookups_for_4_chars/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.outflux.net/blog/archives/2008/11/18/md5_lookups_for_4_chars/</link>
	<description>code is freedom -- patching my itch</description>
	<lastBuildDate>Fri, 12 Mar 2010 03:50:35 -0800</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Brian</title>
		<link>http://www.outflux.net/blog/archives/2008/11/18/md5_lookups_for_4_chars/comment-page-1/#comment-790</link>
		<dc:creator>Brian</dc:creator>
		<pubDate>Sun, 20 Sep 2009 03:23:16 +0000</pubDate>
		<guid isPermaLink="false">http://www.outflux.net/blog/?p=173#comment-790</guid>
		<description>If you want a larger database oh hashes to search, try http://www.netmd5crack.com</description>
		<content:encoded><![CDATA[<p>If you want a larger database oh hashes to search, try <a href="http://www.netmd5crack.com" rel="nofollow">http://www.netmd5crack.com</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aigars Mahinovs</title>
		<link>http://www.outflux.net/blog/archives/2008/11/18/md5_lookups_for_4_chars/comment-page-1/#comment-684</link>
		<dc:creator>Aigars Mahinovs</dc:creator>
		<pubDate>Wed, 19 Nov 2008 12:41:39 +0000</pubDate>
		<guid isPermaLink="false">http://www.outflux.net/blog/?p=173#comment-684</guid>
		<description>Databases are not optimal data store when the structure of the requests is very predictable. If you only need a way to lookup hash-&gt;string, then the simplest way would be to make a folder tree: /a/b/c/d/1/3/f/ and have each end folder contain a strings.txt file with &quot;hashstring&quot; per line. Easy to create and use and VERY fast to look up.</description>
		<content:encoded><![CDATA[<p>Databases are not optimal data store when the structure of the requests is very predictable. If you only need a way to lookup hash-&gt;string, then the simplest way would be to make a folder tree: /a/b/c/d/1/3/f/ and have each end folder contain a strings.txt file with &#8220;hashstring&#8221; per line. Easy to create and use and VERY fast to look up.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lynk</title>
		<link>http://www.outflux.net/blog/archives/2008/11/18/md5_lookups_for_4_chars/comment-page-1/#comment-683</link>
		<dc:creator>Lynk</dc:creator>
		<pubDate>Wed, 19 Nov 2008 10:48:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.outflux.net/blog/?p=173#comment-683</guid>
		<description>I will be doing a rewrite of md5oogle soon. Rainbow files I plan to add sometime next year.  The database is made up of as you said most 4 letter combinations along with self-generated dictionary, and downloaded dictionary files from multiple languages.</description>
		<content:encoded><![CDATA[<p>I will be doing a rewrite of md5oogle soon. Rainbow files I plan to add sometime next year.  The database is made up of as you said most 4 letter combinations along with self-generated dictionary, and downloaded dictionary files from multiple languages.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Sebastian</title>
		<link>http://www.outflux.net/blog/archives/2008/11/18/md5_lookups_for_4_chars/comment-page-1/#comment-682</link>
		<dc:creator>Sebastian</dc:creator>
		<pubDate>Wed, 19 Nov 2008 06:24:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.outflux.net/blog/?p=173#comment-682</guid>
		<description>Just use Google to search for a MD5 hash, for dictionary words chances are good to get a hit (in some example code etc). Sebastian</description>
		<content:encoded><![CDATA[<p>Just use Google to search for a MD5 hash, for dictionary words chances are good to get a hit (in some example code etc). Sebastian</p>
]]></content:encoded>
	</item>
</channel>
</rss>
