Are collision-resistant hash functions even possible? [see description]
63345
What are preimage resistance and collision resistance, and how can the lack thereof be exploited?
27598
Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize?
8872
Why is feed-forward mechanism used in hash functions?
153013
How to implement an efficient bidirectional hash table?
128785
How can uniformity of hash functions (e.g. SHA-256) be proved?
106978
Can hash tables really be O(1)?
33680
Malleability attacks against encryption without authentication
22599
Using a Hash as a secure PRNG
135486
Can Fully Homomorphic Encryption do comparisons?
37207
Understanding strange Java hash function
114578
Design properties of the Rijndael finite field?
133269
Symmetric encryption construction (meet-in-the-middle attack)
69634
How can I instantiate a generalized hash function?
11080
Are common cryptographic hashes bijective when hashing a single block of the same size as the output?
143728
Is there a way of maintaining malleability in a homomorphic encryption system while making it infeasible to perform chosen ciphertext attacks?
128726
MySQL Hashing Function Implementation
31386
Is it safe to ignore the possibility of SHA collisions in practice?