RSA cryptosystem

Question

Hi, I'm trying to set up an RSA cryptosystem. I have all the values except for d selected primes: p=1889, q=2003, n=3783667, phi=3779776,e= 61

I'm stuck on a search, can someone help me sort it out?

RSA cryptosystem setup

• Selected two large distinct primes pand q,, and are calculated n = pqand Φ(n) = (p − 1)(q − 1).

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

  ed ≡ 1 (mod Φ (n)).

• Numbers p, qand Φ(n)then discarded.

• The pair is (e, n)published as a public encryption key
• Number dis the secret decryption key.

Answer 1

Here , step by step, including a search d.
m from the article is your Φ (n).
Now you are trying to find d = (1 + nm) / e, working through the values ​​of n until an integer solution for e is found.

Edit: Here you will find a more detailed explanation of the whole algorithm.