query: Encryption algorithms and the "One-Time pad"
positive_passages.docid: 5636
positive_passages.text: Why not the one-time pad with pseudo-number generator
negative_passages.docid: 70064
negative_passages.text: Computational complexity of RSA
negative_passages.docid: 17900
negative_passages.text: Early propagation of carries in the BLAKE hash function
negative_passages.docid: 138218
negative_passages.text: Is it possible to perform a rudimentary asymmetric key encryption algorithm by hand?
negative_passages.docid: 111491
negative_passages.text: Affine Cipher Cryptanalysis
negative_passages.docid: 155569
negative_passages.text: Choosing finite field size in Shamir's Secret Sharing Scheme
negative_passages.docid: 66789
negative_passages.text: Coefficients in Shamir's Secret Sharing Scheme
negative_passages.docid: 135486
negative_passages.text: Can Fully Homomorphic Encryption do comparisons?
negative_passages.docid: 18134
negative_passages.text: How do I securely store encryption keys in java?
negative_passages.docid: 79726
negative_passages.text: Inverse public-key encryption
negative_passages.docid: 133525
negative_passages.text: Easily reversible hash functions as a method of data transmission
negative_passages.docid: 76954
negative_passages.text: Are there any cryptographic algorithms, which lets the user apply some modifications on the encoded data, without decoding it?
negative_passages.docid: 82438
negative_passages.text: How to combine symmetric and asymmetric encryption?
negative_passages.docid: 79203
negative_passages.text: Brute-force attacking One Time Pads feasible?
negative_passages.docid: 84835
negative_passages.text: Can a computationally unbounded adversary break any public-key encryption scheme?
negative_passages.docid: 158946
negative_passages.text: Encryption algorithm for an app
negative_passages.docid: 40477
negative_passages.text: Is a book cipher provably secure?