query: Effect of the birthday bound on AES-GCM
positive_passages.docid: 154954
positive_passages.text: Does GCM (or GHASH) only provide 64-bit security against forgeries?
negative_passages.docid: 44117
negative_passages.text: Symmetric vs. Asymmetric cryptographic approaches to data security
negative_passages.docid: 84904
negative_passages.text: Why does AES-GCM need a hash/MAC in TLS?
negative_passages.docid: 111491
negative_passages.text: Affine Cipher Cryptanalysis
negative_passages.docid: 5636
negative_passages.text: Why not the one-time pad with pseudo-number generator
negative_passages.docid: 59432
negative_passages.text: Why does error propagation in CBC mode encryption affect two blocks?
negative_passages.docid: 116917
negative_passages.text: How does the CBC Padding Oracle Attack work in General?
negative_passages.docid: 26526
negative_passages.text: Why is AES resistant to known-plaintext attacks?
negative_passages.docid: 121251
negative_passages.text: Do known-plaintext attacks exist for public key encryption?
negative_passages.docid: 53960
negative_passages.text: birthday problem - expected number of collisions
negative_passages.docid: 112953
negative_passages.text: Why in one time pad must the key distribution to be truly random
negative_passages.docid: 117195
negative_passages.text: For Diffie-Hellman, must g be a generator?
negative_passages.docid: 84835
negative_passages.text: Can a computationally unbounded adversary break any public-key encryption scheme?
negative_passages.docid: 136845
negative_passages.text: What is the probability of any two users generating the same 128, 256, 2048 bit key?
negative_passages.docid: 143064
negative_passages.text: Hill Cipher known plaintext attack
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function
negative_passages.docid: 81087
negative_passages.text: Can the birthday attack be extended in this case?