query: hash functions preimage and second collision resistance
positive_passages.docid: 149546
positive_passages.text: Why doesn't preimage resistance imply the second preimage resistance?
negative_passages.docid: 97347
negative_passages.text: Should HMAC-SHA3 be preferred over H(C(k,M))?
negative_passages.docid: 33888
negative_passages.text: Are there MD5 collisions for inputs of different length?
negative_passages.docid: 97141
negative_passages.text: Is any 64-bit portion of a 128-bit hash as collision-proof as a 64-bit hash?
negative_passages.docid: 109037
negative_passages.text: Differences between hash- and encryption algorithms?
negative_passages.docid: 157774
negative_passages.text: SQL Server Query Plan Hash Collision
negative_passages.docid: 98404
negative_passages.text: Is there a simple hash function that one can compute without a computer?
negative_passages.docid: 39614
negative_passages.text: Is a second preimage attack on MD5 feasible?
negative_passages.docid: 54163
negative_passages.text: What makes a hash function good for password hashing?
negative_passages.docid: 11080
negative_passages.text: Are common cryptographic hashes bijective when hashing a single block of the same size as the output?
negative_passages.docid: 43473
negative_passages.text: Turning a cipher into a hashing function
negative_passages.docid: 158125
negative_passages.text: Hashing arrays in Python
negative_passages.docid: 7221
negative_passages.text: How does a hash table work?
negative_passages.docid: 55689
negative_passages.text: Why are the Davies-Meyer and Miyaguchi-Preneel constructions secure?
negative_passages.docid: 54384
negative_passages.text: Why does SHA-2 call for doing 10* padding in addition to appending the message length?
negative_passages.docid: 122054
negative_passages.text: SHA-3 Sub-Function Reversibility Clarification
negative_passages.docid: 85503
negative_passages.text: Will hashing over and over eventually give the same hash?