Is RSA Encryption Safe for Data Security?

1 reply · 3K views · last reply
Firepanda
Messages
425
Reaction score
0
Typed problem statement on RSA: given public key (n,e), plaintext m and ciphertext c = m^e mod n, prove a positive integer k exists with m^(ek) ≡ m mod n, then prove c^(ek-1) ≡ m mod n, and asks whether this is dangerous for RSA.


I started by saying

cince c = me mod n (1)

then me ≡ c mod n

Since this is true then

mek ≡ cek-1 mod n

and cek-1 = (me)ek-1 mod n, by (1)

= mek mod n

=> k is a generator of e

and so both are proved? Not sure..

Also I haven't a clue is it's dangerous or not for RSA.

Thanks for any help.