query: “Prime conspiracy”'s effect on cryptography
positive_passages.docid: 143503
positive_passages.text: Do these new insights into prime numbers affect encryption security?
negative_passages.docid: 35371
negative_passages.text: The pseudoness of pseudorandom number generators
negative_passages.docid: 51059
negative_passages.text: Real-world applications of prime numbers?
negative_passages.docid: 111491
negative_passages.text: Affine Cipher Cryptanalysis
negative_passages.docid: 64578
negative_passages.text: How can an encryption scheme be indistinguishable with multiple messages but vulnerable to an adaptive chosen-plaintext attack?
negative_passages.docid: 314
negative_passages.text: Calculating RSA private exponent when given public exponent and the modulus factors using extended euclid
negative_passages.docid: 92147
negative_passages.text: Coin sequence paradox from Martin Gardner's book
negative_passages.docid: 84835
negative_passages.text: Can a computationally unbounded adversary break any public-key encryption scheme?
negative_passages.docid: 82460
negative_passages.text: Impacts of not using RSA exponent of 65537
negative_passages.docid: 34578
negative_passages.text: Kerckhoffs’ principles – Why should I make my cipher public?
negative_passages.docid: 68819
negative_passages.text: Timing attacks against RSA, DH and AES
negative_passages.docid: 55199
negative_passages.text: Number Theory in a Choice-less World
negative_passages.docid: 90648
negative_passages.text: Why is asymmetric cryptography bad for huge data?
negative_passages.docid: 144812
negative_passages.text: Common modulus attack on RSA when the 2 public exponents differ by a single bit
negative_passages.docid: 80005
negative_passages.text: Does homomorphic encryption hide the algorithm itself?
negative_passages.docid: 44117
negative_passages.text: Symmetric vs. Asymmetric cryptographic approaches to data security
negative_passages.docid: 43003
negative_passages.text: lcm versus phi in RSA