Is RSA Encryption Safe for Data Security?

[Firepanda]

I started by saying

cince c = m^e mod n (1)

then m^e ≡ c mod n

Since this is true then

m^ek ≡ c^ek-1 mod n

and c^ek-1 = (m^e)^ek-1 mod n, by (1)

= m^ek 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.

 

[Firepanda]

Bump for desperate help!