query: Example of a Hash function which is second pre-image resistant but not collision resistant
positive_passages.docid: 22737
positive_passages.text: Are there attacks that break collision resistance but not preimage resistance?
negative_passages.docid: 147359
negative_passages.text: Can I retrieve a re-hashed (hash) value, for instance by additional hashing?
negative_passages.docid: 43473
negative_passages.text: Turning a cipher into a hashing function
negative_passages.docid: 64371
negative_passages.text: Can I use HMAC-SHA1 in counter mode to make a stream cipher?
negative_passages.docid: 158125
negative_passages.text: Hashing arrays in Python
negative_passages.docid: 136965
negative_passages.text: SHA-256 "almost unique"?
negative_passages.docid: 52243
negative_passages.text: Which hash algorithm is most secure for passwords?
negative_passages.docid: 9414
negative_passages.text: Is There a Natural Way to Extend Repeated Exponentiation Beyond Integers?
negative_passages.docid: 103141
negative_passages.text: Cryptographic hash where the hashing function input is similar to the result
negative_passages.docid: 63345
negative_passages.text: What are preimage resistance and collision resistance, and how can the lack thereof be exploited?
negative_passages.docid: 54978
negative_passages.text: Is there a production ready lock-free queue or hash implementation in C++
negative_passages.docid: 128785
negative_passages.text: How can uniformity of hash functions (e.g. SHA-256) be proved?
negative_passages.docid: 153013
negative_passages.text: How to implement an efficient bidirectional hash table?
negative_passages.docid: 132934
negative_passages.text: Does SHA-1 hash have quasi commutative property?
negative_passages.docid: 102786
negative_passages.text: Why are the IV (constant) values fixed for HMAC/SHA?
negative_passages.docid: 110947
negative_passages.text: Unique construct for passing a hash
negative_passages.docid: 96429
negative_passages.text: How do hashes really ensure uniqueness?