-4

I have this exercise:

we have the following RSA public key $n = 275398901700898900724918474136345950999$
$e = 5$
Alice encrypts the message $M$ with the native RSA. She computes $C = M^e \pmod n$ and sends to Bob $C = 170841202002112185870598344402287193795$ Recover the original message $M$.

I'm playing some ctf online. I'm new in crypto and just want to know if I can decrypt the message using a tool.

CodesInChaos
  • 24,841
  • 2
  • 89
  • 128
ahmedbhs
  • 111
  • 3

1 Answers1

2

This is an homework question so my answer won't be an answer but the very basic steps to find your answer. I let voluntarily enough informations hidden so you still have some work to do.

  1. Factorise $n$

  2. find $d$ the private key using $\varphi(n)$ and the extended euclidean algorithm.

  3. compute $C^d \pmod n$ this should be your initial $M$.

Biv
  • 9,979
  • 2
  • 39
  • 67