query: A simple attack on DESX in time $2^{120}$
positive_passages.docid: 17934
positive_passages.text: DES-X , computation load and storage
negative_passages.docid: 124901
negative_passages.text: Big-O notation and polynomials
negative_passages.docid: 32950
negative_passages.text: Fake induction proofs
negative_passages.docid: 155569
negative_passages.text: Choosing finite field size in Shamir's Secret Sharing Scheme
negative_passages.docid: 31454
negative_passages.text: IND-CPA security of mode of operation using triple AES with plaintext || IV+counter
negative_passages.docid: 35371
negative_passages.text: The pseudoness of pseudorandom number generators
negative_passages.docid: 79203
negative_passages.text: Brute-force attacking One Time Pads feasible?
negative_passages.docid: 9118
negative_passages.text: Polynomial division: an obvious trick? [reducing mod $\textit{simpler}$ multiples]
negative_passages.docid: 84835
negative_passages.text: Can a computationally unbounded adversary break any public-key encryption scheme?
negative_passages.docid: 102307
negative_passages.text: Discrete Math Proofs Involving Real Numbers
negative_passages.docid: 62196
negative_passages.text: Statistical saturation attack on block ciphers
negative_passages.docid: 7584
negative_passages.text: Preventing Quantum Attacks on Cryptography
negative_passages.docid: 106797
negative_passages.text: Truth Tables for Digital Circuits
negative_passages.docid: 75339
negative_passages.text: Bit Flipping Attack on CBC Mode
negative_passages.docid: 141010
negative_passages.text: Computing $n$-th external power of standard simplectic form
negative_passages.docid: 71821
negative_passages.text: How do I derive the time complexity of encryption and decryption based on modular arithmetic?
negative_passages.docid: 5636
negative_passages.text: Why not the one-time pad with pseudo-number generator