1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

RSA Encryption simple proof

  1. Dec 1, 2009 #1

    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.
  2. jcsd
  3. Dec 2, 2009 #2
    Bump for desperate help!
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: RSA Encryption simple proof
  1. RSA encryption problem (Replies: 2)

  2. Simple proof ? (Replies: 4)

  3. Simple Proof? (Replies: 10)

  4. Simple Proof (Replies: 2)

  5. RSA Encryption (Replies: 2)