Results 1 to 2 of 2

Math Help - RSA encryption process

  1. #1
    Newbie
    Joined
    May 2010
    From
    Atlanta, GA
    Posts
    9

    Wink RSA encryption process

    Needing to see a solution to de is congruent to 1 mod phi of pq. pq needs to be > 9875040
    Last edited by Waikato; July 12th 2010 at 03:41 AM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor undefined's Avatar
    Joined
    Mar 2010
    From
    Chicago
    Posts
    2,340
    Awards
    1
    Quote Originally Posted by Waikato View Post
    Go through the RSA encryption/decryption process for the message which is 9785004. First choose two prime numbers so their product is larger than 9875004.
    Have you tried doing this yourself? There is some time involved, but the procedure itself is not too difficult, probably the hardest parts are finding a modular inverse (when solving de\equiv1\ \text{(mod }\varphi(pq)\text{)}), and then modular exponentiation for encrypting and decrypting. Please show some work and let us know where you are getting stuck, also please tell us whether you're allowed to use a computer algebra system (CAS) like PARI/GP or Mathematica, or if you need to do everything by hand, or with a pocket calculator, etc.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. RSA Encryption
    Posted in the Number Theory Forum
    Replies: 0
    Last Post: March 18th 2011, 06:52 PM
  2. Encryption
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: November 11th 2010, 04:47 AM
  3. encryption vig
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: May 11th 2010, 10:31 PM
  4. RSA Encryption
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: October 18th 2006, 10:28 AM
  5. RSA encryption
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: April 27th 2006, 06:24 PM

Search Tags


/mathhelpforum @mathhelpforum