ForensicsWiki will continue to operate as it has before and will not be shutting down. Thank you for your continued support of ForensicsWiki.

Difference between pages "Blowfish" and "Bloom Filters"

From ForensicsWiki
(Difference between pages)
Jump to: navigation, search
m (Category, bullets for links)
 
m
 
Line 1: Line 1:
{{Expand}}
+
=References=
 +
* [http://www.internetmathematics.org/volumes/1/4/Broder.pdf Network Applications of Bloom Filters: A Survey], Andrei Broder and Michael Mitzenmacher, Internet Mathematics Vol. 1, No 4: 485--509
  
'''Blowfish''' is a symmetric block cipher designed by [[Bruce Schneier]]. It uses a 64-bit block cipher and a variable-length key (32 bits to 448 bits).
+
* [http://portal.acm.org/citation.cfm?id=1151659.1159950 Beyond bloom filters: from approximate membership checks to approximate state machines], Bonomi et all, ACM SIGCOMM Computer Communication Review archive, Volume 36 ,  Issue 4  (October 2006)  
  
Blowfish is not subject to patents and is freely available for use.
+
* Burton H. Bloom, [http://portal.acm.org/citation.cfm?id=362692&dl=GUIDE&coll=GUIDE&CFID=59101912&CFTOKEN=60283506 Space/time trade-offs in hash coding with allowable errors], Communications of the ACM, v.13 n.7, p.422-426, July 1970
  
== External Links ==
+
* [http://dfrws.org/2006/proceedings/11-Roussev.pdf md5bloom: Forensic filesystem hashing revisited], Vassil Roussev*, Yixin Chen, Timothy Bourg, Golden G. Richard III , 2006 DFRWS. Published by Elsevier Ltd.
 
+
* [http://www.schneier.com/blowfish.html The Blowfish Encryption Algorithm]
+
* [http://en.wikipedia.org/wiki/Blowfish_(cipher) Wikipedia article on Blowfish]
+
 
+
[[Category:Encryption]]
+

Revision as of 04:45, 13 March 2008

References