nice
c = m^e mod n
Here we have c, e and n.. we need to calculate m. Since e = 1 its very easy to solve. Final value has to be converted from declimal to hexa to text
Almost had it!
Nice enough to do baby steps, but this challenge should come before RSA Beginner I think
c = m^e mod n
Here we have c, e and n.. we need to calculate m. Since e = 1 its very easy to solve. Final value has to be converted from declimal to hexa to text
u should up ur e and n also :/
Exercise is the first RSA challenge i've seen on CFTlearn, and a credit to the website! Thank you for the challenge :)
3 months ago
How Euler's Theorem is used?