Update for 02-02-22 15:00
This commit is contained in:
parent
390f012fa9
commit
f6b4a55fb3
13
tech/Bloom_filter.wiki
Normal file
13
tech/Bloom_filter.wiki
Normal file
@ -0,0 +1,13 @@
|
||||
= Bloom filter =
|
||||
|
||||
A bloom filter is a space efficient data structure that can test if an element
|
||||
is part of a set *false positives are possible*, however false negatives are
|
||||
not. Meaning it can return,
|
||||
|
||||
* Possibly in the set
|
||||
* Definitly not in the set
|
||||
|
||||
== Implementation ==
|
||||
|
||||
* Simple [[hash_table]] set
|
||||
*
|
@ -21,9 +21,14 @@ Different ways to store and operate on data, with differing efficiency
|
||||
* [[splay_tree|Splay Tree]]
|
||||
* [[avl_tree|AVL Tree]]
|
||||
* [[kd_tree|KD Tree]]
|
||||
* [[Heap]]
|
||||
* [[Heap]]
|
||||
- [[Fibonacci_heap]]
|
||||
|
||||
== Probabilistic Data Structures ==
|
||||
|
||||
* [[Bloom_filter]]
|
||||
|
||||
|
||||
== Common Algorithms ==
|
||||
|
||||
=== Graph and Tree ===
|
||||
|
@ -33,5 +33,3 @@ Derived requirements from this,
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
|
@ -17,7 +17,13 @@
|
||||
== Improvements ==
|
||||
|
||||
* Use MD5 hash
|
||||
* 48 bit salt
|
||||
* password length is unlimited
|
||||
* 128bit hash
|
||||
* Uses inner loop with 1000 iterations
|
||||
* 48 bit salt
|
||||
* password length is unlimited
|
||||
* 128bit hash
|
||||
* Uses inner loop with 1000 iterations
|
||||
* OpenBSD uses Blowfish based hash called Bcrypt
|
||||
* Most secure unix hash/salt scheme
|
||||
* uses 128bit salt to make 192bit hash value
|
||||
* Use a shadow password file
|
||||
* separate file with hash; different file with ID
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user