query: DES algorithm exhaustive key search 2^55 instead of 2^56
positive_passages.docid: 22630
positive_passages.text: DES with the bitwise complement of a key
negative_passages.docid: 112599
negative_passages.text: What is the smallest value of n such that an algorithm running at 100*n^2 operates faster than 2^n ? [How to figure out without brute force]
negative_passages.docid: 49011
negative_passages.text: How to find last two digits of $2^{2016}$
negative_passages.docid: 91565
negative_passages.text: How to efficiently compute $\,25^{37}\pmod{55}$?
negative_passages.docid: 100367
negative_passages.text: How much can we compress RSA public keys?
negative_passages.docid: 100640
negative_passages.text: K out of N encryption
negative_passages.docid: 136759
negative_passages.text: How many bits of hash are realistically needed for key verification?
negative_passages.docid: 2954
negative_passages.text: Extended Euclidean Algorithm in $GF(2^8)$?
negative_passages.docid: 64163
negative_passages.text: Using Chi-Square for Vigenère Cipher
negative_passages.docid: 128081
negative_passages.text: RSA encryption. Breaking 2048 keys with index
negative_passages.docid: 21657
negative_passages.text: Trim with LVM and dm-crypt
negative_passages.docid: 139568
negative_passages.text: Can double-encrypting be easier to break then either algorithm on its own?
negative_passages.docid: 144096
negative_passages.text: Can I shorten the large ECDSA public key output file from OpenSSL?
negative_passages.docid: 138951
negative_passages.text: Affine cipher: calculate the key from a known plaintext/ciphertext pair
negative_passages.docid: 122595
negative_passages.text: Probability of false positive key matching two plaintext/ciphertext pairs
negative_passages.docid: 39396
negative_passages.text: Breaking a small-scale Example Diffie-Hellman?
negative_passages.docid: 136478
negative_passages.text: Hash keys probe and residual