query: Vulnerabilities in SHA-1
positive_passages.docid: 20749
positive_passages.text: Why is SHA-1 considered broken?
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function
negative_passages.docid: 97347
negative_passages.text: Should HMAC-SHA3 be preferred over H(C(k,M))?
negative_passages.docid: 48100
negative_passages.text: Security threats with uploads
negative_passages.docid: 58472
negative_passages.text: Fiat-Shamir transform: reliance on hash input by interactive proof
negative_passages.docid: 52243
negative_passages.text: Which hash algorithm is most secure for passwords?
negative_passages.docid: 88873
negative_passages.text: Is a hash a zero-knowledge proof?
negative_passages.docid: 15207
negative_passages.text: Can insecure algorithms be combined to form a secure algorithm?
negative_passages.docid: 37207
negative_passages.text: Understanding strange Java hash function
negative_passages.docid: 98804
negative_passages.text: Benchmark (hash rate) for SHA-3 (SHAKE128)
negative_passages.docid: 79891
negative_passages.text: Key Derivation Functions vs. Password Hashing Schemes
negative_passages.docid: 110024
negative_passages.text: What is the complexity of finding SHA-1 collisions?
negative_passages.docid: 136965
negative_passages.text: SHA-256 "almost unique"?
negative_passages.docid: 7285
negative_passages.text: Is SHA-256 secure as a CTR block cipher?
negative_passages.docid: 147696
negative_passages.text: Security equivalence proofs for breaking RSA
negative_passages.docid: 45556
negative_passages.text: Is there a cryptographic algorithm which is immune to side channel attacks?
negative_passages.docid: 49538
negative_passages.text: Does salt size affect password hash security?