query: SHA-256 : Finding two strings that the first n bits of hash value are same
positive_passages.docid: 155676
positive_passages.text: SHA-256 Partial Collision of initial 36 bits and more
negative_passages.docid: 136478
negative_passages.text: Hash keys probe and residual
negative_passages.docid: 65609
negative_passages.text: Why does Java's hashCode() in String use 31 as a multiplier?
negative_passages.docid: 41143
negative_passages.text: How to make the correct hash-symbol in C Sharp (C#)
negative_passages.docid: 96356
negative_passages.text: Keccak padding implementation, and bit ordering
negative_passages.docid: 20913
negative_passages.text: Why does `md5sum` not give the same hash as the Internet does?
negative_passages.docid: 101173
negative_passages.text: Testing string equality using hashCode()
negative_passages.docid: 33021
negative_passages.text: How is input message for SHA-2 padded?
negative_passages.docid: 141226
negative_passages.text: How can I see if a Perl hash already has a certain key?
negative_passages.docid: 29868
negative_passages.text: Is there an MD5 Fixed Point where md5(x) == x?
negative_passages.docid: 62998
negative_passages.text: How to match multiple copies of a value?
negative_passages.docid: 98404
negative_passages.text: Is there a simple hash function that one can compute without a computer?
negative_passages.docid: 130791
negative_passages.text: What is a good Hash Function?
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: 38505
negative_passages.text: Matching MD5 Hashes from another script
negative_passages.docid: 54163
negative_passages.text: What makes a hash function good for password hashing?
negative_passages.docid: 38109
negative_passages.text: Making hashes find each other by their values using Ruby