query: Is there any rules for choosing the two primes that's used in generating RSA keys?
positive_passages.docid: 27686
positive_passages.text: How can I generate large prime numbers for RSA?
negative_passages.docid: 43477
negative_passages.text: Choosing between additive or multiplicative group for Diffie-Hellman
negative_passages.docid: 141747
negative_passages.text: Difficulty of breaking RSA for a given key size
negative_passages.docid: 53539
negative_passages.text: RSA encryption/decryption process is not working correctly
negative_passages.docid: 20397
negative_passages.text: In RSA, why is it important to choose e so that it is coprime to φ(n)?
negative_passages.docid: 27270
negative_passages.text: How to generate a key using any $m$ passwords out of total $n$?
negative_passages.docid: 105871
negative_passages.text: Length of message in RSA and splitting of long messages
negative_passages.docid: 157766
negative_passages.text: Are primes (ignoring $2$) equally likely to be $1~\text{or}~3\pmod 4$?
negative_passages.docid: 21274
negative_passages.text: Security strength of RSA in relation with the modulus size
negative_passages.docid: 56094
negative_passages.text: Why use a prime number in hashCode?
negative_passages.docid: 20480
negative_passages.text: Using the same RSA keypair to sign and encrypt
negative_passages.docid: 207
negative_passages.text: How to calculate RSA CRT parameters from public key and private exponent
negative_passages.docid: 135417
negative_passages.text: RSA when N=pq and p = q
negative_passages.docid: 13007
negative_passages.text: Why can ECC key sizes be smaller than RSA keys for similar security?
negative_passages.docid: 26462
negative_passages.text: What's the fundamental difference between Diffie-Hellman and RSA?
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: 157856
negative_passages.text: ECC vs RSA: how to compare key sizes?