Context Triggered Piecewise Hashing - Revision history

Jessek at 15:50, 20 December 2007

2007-12-20T15:50:34Z

Jessek at 13:17, 9 April 2007

2007-04-09T13:17:55Z

Jessek at 13:01, 9 March 2007

2007-03-09T13:01:27Z

Jessek at 13:01, 9 March 2007

2007-03-09T13:01:05Z

Jessek at 04:59, 27 February 2007

2007-02-27T04:59:00Z

Jessek at 16:04, 24 February 2007

2007-02-24T16:04:24Z

Jessek at 12:17, 6 September 2006

2006-09-06T12:17:35Z

Jessek: Added link to DFRWS paper

2006-09-06T12:16:56Z

Added link to DFRWS paper

Jessek at 13:38, 17 August 2006

2006-08-17T13:38:56Z

New page

Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order.

ssdeep - http://ssdeep.sf.net/

← Older revision		Revision as of 15:50, 20 December 2007
Line 7:		Line 7:

	* [[ssdeep]] is a cross-platform CTPH client.		* [[ssdeep]] is a cross-platform CTPH client.
		+
		+	== See Also ==
		+	* [[Piecewise hashing]]

	== External Links ==		== External Links ==

← Older revision		Revision as of 13:17, 9 April 2007
Line 11:		Line 11:

	* [http://samba.org/ftp/unpacked/junkcode/spamsum/ SpamSum]		* [http://samba.org/ftp/unpacked/junkcode/spamsum/ SpamSum]
		+
		+	[[Category:Hashing]]

← Older revision		Revision as of 13:01, 9 March 2007
Line 1:		Line 1:
	{{Expand}}		{{Expand}}
−
−	~~Bas~~
−
	Context Triggered Piecewise Hashing, also called '''Fuzzy Hashing''', can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.		Context Triggered Piecewise Hashing, also called '''Fuzzy Hashing''', can match inputs that have homologies. Such inputs have sequences of identical bytes in the same order, although bytes in between these sequences may be different in both content and length.

@@ Line 1: / Line 1: @@
 {{Expand}}
-Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order. This technique was originally published at the [[DFRWS]] conference in 2006 in a paper [http://dfrws.org/2006/proceedings/12-Kornblum.pdf |Identifying Almost Identical Files Using Context Triggered Piecewise Hashing].
+Bas
 == Implementations ==
-CTPH has been implemented in the program [[ssdeep]].
+* [[ssdeep]] is a cross-platform CTPH client.

← Older revision		Revision as of 04:59, 27 February 2007
Line 1:		Line 1:
		+	{{Expand}}
		+
	Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order. This technique was originally published at the [[DFRWS]] conference in 2006 in a paper [http://dfrws.org/2006/proceedings/12-Kornblum.pdf \|Identifying Almost Identical Files Using Context Triggered Piecewise Hashing].		Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order. This technique was originally published at the [[DFRWS]] conference in 2006 in a paper [http://dfrws.org/2006/proceedings/12-Kornblum.pdf \|Identifying Almost Identical Files Using Context Triggered Piecewise Hashing].

@@ Line 1: / Line 1: @@
-Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order. This technique was originally published at the [[DFRWS]] conference in 2006 in a paper [http://dfrws.org/2006/proceedings/12-Kornblum.pdf|Identifying Almost Identical Files Using Context Triggered Piecewise Hashing].
+Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order. This technique was originally published at the [[DFRWS]] conference in 2006 in a paper [http://dfrws.org/2006/proceedings/12-Kornblum.pdf |Identifying Almost Identical Files Using Context Triggered Piecewise Hashing].
 External Links:
 ssdeep - http://ssdeep.sf.net/

← Older revision		Revision as of 12:16, 6 September 2006
Line 1:		Line 1:
−	Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order.	+	Based on the work of Dr. Andrew Tridgell, Context Triggered Piecewise Hashing, aka Fuzzy Hashing, can match inputs that have many homologies. This means that the inputs have large sequences of bytes that are identical and in the same order. This technique was originally published at the [[DFRWS]] conference in 2006 in a paper [http://dfrws.org/2006/proceedings/12-Kornblum.pdf\|Identifying Almost Identical Files Using Context Triggered Piecewise Hashing].
		+
		+	External Links:

	ssdeep - http://ssdeep.sf.net/		ssdeep - http://ssdeep.sf.net/