Generic Collision Attacks on Narrow-pipe Hash Functions Faster than Birthday Paradox, Applicable to MDx, SHA-1, SHA-2, and SHA-3 Narrow-pipe Candidates.
Vlastimil KlímaDanilo GligoroskiPublished in: IACR Cryptol. ePrint Arch. (2010)
Keyphrases
- hash functions
- block cipher
- locality sensitive
- similarity search
- stream cipher
- locality sensitive hashing
- hashing algorithm
- hamming distance
- order preserving
- cross section
- nearest neighbor search
- secret key
- hash table
- minimal perfect hash functions
- data sets
- collision detection
- data distribution
- pattern matching
- similarity measure
- feature extraction
- feature selection
- neural network