# How to find prime number q in RSA?

To be assumed in RSA key generation algorithm $$p$$ is a constant prime number and $$e$$ is an arbitrary prime and also $$d$$ is an odd number that is relatively prime to $$e$$.

Based on these conditions how to find prime number $$q$$?

• Do you only have the modulus and exponent, or do you have at least one primes and the modulus? – forest Jul 12 at 6:39
• "p is a constant prime" makes me feel nervous for gcd. – DannyNiu Jul 12 at 6:58
• I have just the values of one prime number and public exponent e and also privet exponent d – Aida Jul 12 at 9:16
• I am going to integrate two algorithms by using another algorithm I can generate the values of prime number p that is constant and public exponent e that I choose and also private exponent d is an odd number based on these conditions how I can calculate another prime that is q – Aida Jul 12 at 9:22
• You need to read the specifications for the algorithm again. You have some misunderstandings concerning the conditions on some of these parameters. – Ken Goss Jul 12 at 14:00