Results 1 to 4 of 4

Math Help - RSA algorithm why is this impossible for a useful RSA code?

  1. #1
    Senior Member
    Joined
    Oct 2008
    Posts
    393

    RSA algorithm why is this impossible for a useful RSA code?

    e = 3
    n = 10
    M = 7

    phi(n) = (5-1) * (2-1) = 4

    ed = 1 mod 4
    3d = 1 mod 4

    d = 3

    why is this impossible for a useful RSA code?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member Bacterius's Avatar
    Joined
    Nov 2009
    From
    Wellington
    Posts
    927
    I don't know what you mean, it is a correct key generation mathematically speaking. Now, you can see that e = d, which is not great cryptographically speaking. And your semiprime is even (instant factorization). And your values are very small.

    So what do you mean by "impossible" ?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Super Member
    Joined
    Jan 2009
    Posts
    591
    Quote Originally Posted by adam_leeds View Post
    e = 3
    n = 10
    M = 7

    phi(n) = (5-1) * (2-1) = 4

    ed = 1 mod 4
    3d = 1 mod 4

    d = 3

    why is this impossible for a useful RSA code?
    It is a valid RSA setup.
    It is not very useful unless your alphabet only has 10 characters.


    Not impossible.
    But, not very useful.


    Your alphabet may have 26 or 67 or 360 alphabetic characters, but when it is decoded you are going to have only 10 characters {n: 0,1,2,3,4,5,6,7,8,9 }

    If you use the above to encode a message, you will use 1 character of plain_text to generate 1 character of cipher_text.
    After the tenth character you are going to get a 1 to 1 relationship. It becomes a simple substitution cipher.


    Typically, you would want to encode a group of characters at a time.
    Suppose you have a group of plain_text (say 12 characters of your which are ALL ones: 111111111111) and generate a cipher_text.
    If you change a single bit in the plain_text (111111111121) you want generate a completely different cipher_text that has NO similarity to the other cipher_text.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Senior Member
    Joined
    Oct 2008
    Posts
    393
    Quote Originally Posted by Bacterius View Post
    I don't know what you mean, it is a correct key generation mathematically speaking. Now, you can see that e = d, which is not great cryptographically speaking. And your semiprime is even (instant factorization). And your values are very small.

    So what do you mean by "impossible" ?
    not sure thats what my question says, and i dont understand it.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 2
    Last Post: December 14th 2011, 07:30 AM
  2. Optimal algorithm for code cracking
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: February 26th 2009, 02:43 PM
  3. HELP.. HELP .. Another Impossible question
    Posted in the Statistics Forum
    Replies: 2
    Last Post: March 8th 2008, 10:17 AM
  4. [SOLVED] Impossible Question
    Posted in the Statistics Forum
    Replies: 2
    Last Post: December 21st 2006, 02:47 PM
  5. HELP!!!! These are impossible.
    Posted in the Math Topics Forum
    Replies: 4
    Last Post: December 10th 2006, 06:56 PM

Search Tags


/mathhelpforum @mathhelpforum