Results 1 to 3 of 3

Math Help - Modular arithmetic and cryptography

  1. #1
    Junior Member
    Joined
    Mar 2010
    Posts
    26

    Modular arithmetic and cryptography

    Why we need to use modular arithmetic in cryptography like Diffie hellman and RSA problm?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Oct 2009
    From
    New York, NY
    Posts
    6
    Quote Originally Posted by jsridhar72 View Post
    Why we need to use modular arithmetic in cryptography like Diffie hellman and RSA problm?
    Informally, people generally use modular arithmetic in cryptography because it creates a scenario in which one way is solvable in polynomial time (this is the stuff that the two people who are sharing information have to do) and the other way is generally thought to be intractable (this is the stuff that anyone who wants to steal the information has to do). So, modular arithmetic makes it so it's easy enough to communicate information but super hard to steal the information from the outside. The reason for this is, usually, breaking a code that uses modular arithmetic requires being able to factor large numbers in order to find primitive roots or multiplicative inverses, and there is no polynomial time algorithm for factoring.

    there's a decent explanation of Diffie Hellman on wikipedia, too, if you want some more information on what exactly is going on.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Mar 2010
    Posts
    26

    Thank you

    Quote Originally Posted by culturalreference View Post
    Informally, people generally use modular arithmetic in cryptography because it creates a scenario in which one way is solvable in polynomial time (this is the stuff that the two people who are sharing information have to do) and the other way is generally thought to be intractable (this is the stuff that anyone who wants to steal the information has to do). So, modular arithmetic makes it so it's easy enough to communicate information but super hard to steal the information from the outside. The reason for this is, usually, breaking a code that uses modular arithmetic requires being able to factor large numbers in order to find primitive roots or multiplicative inverses, and there is no polynomial time algorithm for factoring.

    there's a decent explanation of Diffie Hellman on wikipedia, too, if you want some more information on what exactly is going on.

    Thanks friend. So as my Professorr said mod provide the security of crypto systems. I saw in some books that because mod arithmetic is easy to with in computers, and to avoid integer division errors people use it. But it seems more than that since it provide one way function so that it is use. Thanky you once again
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Modular arithmetic.
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: March 10th 2011, 06:21 PM
  2. Modular Arithmetic
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 15th 2011, 09:51 PM
  3. Cryptography - Modular Arithmetic
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: February 24th 2010, 11:50 AM
  4. modular arithmetic
    Posted in the Number Theory Forum
    Replies: 3
    Last Post: March 2nd 2009, 01:17 PM
  5. Modular arithmetic
    Posted in the Advanced Algebra Forum
    Replies: 7
    Last Post: September 20th 2008, 10:08 AM

Search Tags


/mathhelpforum @mathhelpforum