« earlier | later » Page 1 of 1
A simplified version of the PATRICIA trie; allows the operations of a hash plus lexicographic lookup, with potentially better efficiency (although I guess you need to be careful about locality).
to associative data-structures djb hash tree ... on 17 December 2016
Why Bloom filters work the way they do | DDI
Good explanation of Bloom filters. (This'd be a nice example of a data structure to explain for FYP.)
to bloom data-structures fyp hash programming ... on 14 December 2013
The Keccak sponge function family
The hash function that's just won the SHA-3 contest. Excellent documentation, including a guide to implementing it that makes very interesting reading.
to cryptography hash sha3 ... on 15 October 2012
Hashes with deliberate collisions for similar data in Python. This is the sort of thing I'm after for location-based hashing in a simulation framework.
to data-structures hash python simulation software ... on 27 May 2012
A Hash Function for Hash Table Lookup
Actually quite a lot of them.
to data-structures hash maths programming ... on 27 February 2012
Good material on simple hash functions and PRNGs, and how to test them.
The SHA-3 Zoo - The ECRYPT Hash Function Website
Submissions to the NIST hash function competition, and attacks on them.
to cryptography hash maths ... on 16 November 2008
A Hash Function for Hash Table Lookup
Descriptions of various hash functions.
« earlier | later » Page 1 of 1
| - hash | |
| 1 | associative |
| 1 | bloom |
| 1 | crypto |
| 2 | cryptography |
| 4 | data-structures |
| 1 | djb |
| 1 | fyp |
| 9 | hash |
| 3 | maths |
| 2 | programming |
| 1 | python |
| 1 | random |
| 1 | sha3 |
| 1 | simulation |
| 4 | software |
| 1 | tree |
tasty by Adam Sampson.