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$?

  • 2
    $\begingroup$ Do you only have the modulus and exponent, or do you have at least one primes and the modulus? $\endgroup$ – forest Jul 12 at 6:39
  • 3
    $\begingroup$ "p is a constant prime" makes me feel nervous for gcd. $\endgroup$ – DannyNiu Jul 12 at 6:58
  • $\begingroup$ I have just the values of one prime number and public exponent e and also privet exponent d $\endgroup$ – Aida Jul 12 at 9:16
  • $\begingroup$ 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 $\endgroup$ – Aida Jul 12 at 9:22
  • $\begingroup$ You need to read the specifications for the algorithm again. You have some misunderstandings concerning the conditions on some of these parameters. $\endgroup$ – Ken Goss Jul 12 at 14:00

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.