query: How can I crack a 16 bit hash/CRC/checksum with a large sample set?
positive_passages.docid: 146670
positive_passages.text: Methods to nail down 16 bit CRC/Checksum algorithm used by Windows CE executable?
negative_passages.docid: 118958
negative_passages.text: Check hash (MD4, MD5, SHA-1, and CRC) on Ubuntu 12.04 and 12.10
negative_passages.docid: 146257
negative_passages.text: Count each bit-position separately over many 64-bit bitmasks, with AVX but not AVX2
negative_passages.docid: 39120
negative_passages.text: how to use common modulus attack?
negative_passages.docid: 9213
negative_passages.text: Attacks of the MAC construction $\mathcal{H}(m\mathbin\|k)$ for common hashes $\mathcal{H}$?
negative_passages.docid: 111810
negative_passages.text: How do I check the checksum of a download and why should I?
negative_passages.docid: 128081
negative_passages.text: RSA encryption. Breaking 2048 keys with index
negative_passages.docid: 78783
negative_passages.text: Java "Bit Shifting" Tutorial?
negative_passages.docid: 33888
negative_passages.text: Are there MD5 collisions for inputs of different length?
negative_passages.docid: 87659
negative_passages.text: SHA256 HMAC brute force with chosen plaintext attacks
negative_passages.docid: 52098
negative_passages.text: How to check if a binary is 16 bit on Windows
negative_passages.docid: 56980
negative_passages.text: How hard is it to generate a simultaneous MD5 and SHA1 collision?
negative_passages.docid: 39930
negative_passages.text: How do I setup an encrypted swap file?
negative_passages.docid: 88031
negative_passages.text: Possible ways to crack simple hand ciphers?
negative_passages.docid: 130791
negative_passages.text: What is a good Hash Function?
negative_passages.docid: 39396
negative_passages.text: Breaking a small-scale Example Diffie-Hellman?
negative_passages.docid: 89172
negative_passages.text: Why are these techniques not feasible to crack RSA?