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 proof, where have I gone wrong?

  1. Dec 2, 2009 #1
    b7nfig.jpg

    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
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted



Similar Discussions: RSA Encryption proof, where have I gone wrong?
  1. I can't start proofs (Replies: 7)

  2. I have a final exam (Replies: 9)

Loading...