head	1.1;
access;
symbols
	RELEASE_8_3_0:1.1
	RELEASE_9_0_0:1.1
	RELEASE_7_4_0:1.1
	RELEASE_8_2_0:1.1
	RELEASE_6_EOL:1.1
	RELEASE_8_1_0:1.1
	RELEASE_7_3_0:1.1
	RELEASE_8_0_0:1.1
	RELEASE_7_2_0:1.1
	RELEASE_7_1_0:1.1
	RELEASE_6_4_0:1.1
	RELEASE_5_EOL:1.1
	RELEASE_7_0_0:1.1
	RELEASE_6_3_0:1.1
	PRE_XORG_7:1.1
	RELEASE_4_EOL:1.1
	RELEASE_6_2_0:1.1;
locks; strict;
comment	@# @;


1.1
date	2006.05.08.00.52.28;	author ehaupt;	state Exp;
branches;
next	;


desc
@@


1.1
log
@Add rainbowcrack 1.2, a hash cracker that precomputes plaintext -
ciphertext pairs in advance.

PR:		96664
Submitted by:	bryan@@freshdns.net
@
text
@RainbowCrack is a general propose implementation of Philippe Oechslin's faster
time-memory trade-off technique.

In short, the RainbowCrack tool is a hash cracker. A traditional brute force
cracker tries all possible plaintexts one by one in cracking time. It is time
consuming to break complex passwords this way. The idea of time-memory trade-off
is to do all cracking time computation in advance and store the result in files
so called "rainbow table". It does take a long time to precompute the tables.
But once the one time precomputation is finished, a time-memory trade-off
cracker can be hundreds of times faster than a brute force cracker, with the
help of precomputed tables.

WWW: http://www.antsight.com/zsl/rainbowcrack/
@
