-3

Hi i am trying to set up an RSA cryptosystem i have all the values except d selected prime numbers: p=1889, q=2003 n=3783667 phi=3779776 e= 61

i got stuck finding d could anyone help me to figure it out?

Setting up an RSA cryptosystem

• Two large distinct prime numbers p and q are selected, and n = pq and Φ(n) = (p − 1)(q − 1) are calculated.

• An integer e is selected such that gcd(Φ(n), e) = 1 and the multiplicative inverse d = e^(−1) in ZΦ(n) is calculated, i.e.

ed ≡ 1 (mod Φ(n)).

• The numbers p, q and Φ(n), are then discarded. • The pair (e, n) is published as the public encryption key • The number d is the secret decryption key.

flag
Sorry, Math Overflow isn't the right place for this question. See mathoverflow.net/faq for an explanation of what kinds of questions are appropriate for this site, as well as a list of other math forums where your question might be more appropriate. You may also want to consider asking this question at stackoverflow.com. – Anton Geraschenko Nov 14 at 20:54

closed as too localized by Reid Barton, Ilya Nikokoshev, Anton Geraschenko♦♦ Nov 14 at 20:49

Browse other questions tagged or ask your own question.