Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Diffie Hellman

Options
  • 08-01-2007 3:30pm
    #1
    cobijones
    Registered Users Posts: 259 ✭✭


    Can anyone tell me if diffie hellman is an example of the discrete logarithmic problem.


Comments

  • Options
    #2
    ZygOte
    Registered Users Posts: 559 ✭✭✭ZygOte


    yes it is, hopefully this will be of use to you

    http://en.wikipedia.org/wiki/Diffie-Hellman

    [/url]http://en.wikipedia.org/wiki/Discrete_logarithm[/url]


  • Options
    #3
    cobijones
    Registered Users Posts: 259 ✭✭cobijones


    Thank you


  • Options
    #4
    cobijones
    Registered Users Posts: 259 ✭✭cobijones


    I was wondering if anyone has any knowledge in this area. I'm trying to understand the mathematical principle behind Diffie Hellman and the use of primitive roots.

    There is an example where it says. calculate y = 10(^97)Mod 89.

    10 = 10 Mod 89
    10^2 = 11 Mod 89
    10^4 = 32 Mod 89
    10^8 = 32 Mod 89
    10^16 = 45 Mod 89
    10^64 = 8 Mod 89

    Therefore
    10^97 Mod 89
    = 10^64.10^32.10.Mod 89
    = 8^39^10.Mod 89
    = 5
    I have no idea what this is about!!

    Could anyone show me a way of going about doing an example where it says take a prime numer 11 and another number 3 which may be published. Use them to illustrate the diffie hellman method?

    I'm lost!


Advertisement