Diffie-Hellman: The Math (simplified)

Поділитися
Вставка
  • Опубліковано 28 лют 2012
  • Another lesson from Prof. Gideon Crypto Academy: a brief, yet precise explanation of the mathematical procedure developed by Diffie and Hellman to allow for two strangers on the Internet to establish a confidential channel of communication. Visit the academy at: WeSecure.net/learn.
  • Наука та технологія

КОМЕНТАРІ • 12

  • @Jan3zz
    @Jan3zz 9 років тому +3

    Plain and simple. Best high level explanation I heard of, thank you!

  • @UPPERKEES
    @UPPERKEES 6 років тому

    I really enjoy your videos, thank you for taking the time to explain this so well.

  • @schifoso
    @schifoso 7 років тому

    Very well explained. Straight forward, engaging, and easy to understand. Thank you.

    • @GideonTheTeacher
      @GideonTheTeacher  7 років тому

      Thank you Robert Z for your feedback, will try to put forward more of the same!

  • @pinkerpanter9220
    @pinkerpanter9220 10 років тому +1

    thanks for the explanation, i love your enthusiasm

  • @luvlyadaku
    @luvlyadaku 10 років тому

    you are a great teacher

  • @asankaishara
    @asankaishara 5 років тому

    wow..very good explanation.. thank you

  • @JohnNKyriacou
    @JohnNKyriacou 8 років тому

    Bravo! I understand.

  • @Mellyp2021
    @Mellyp2021 9 років тому

    Your teaching style makes sense to me. Would you mind creating a video on the Pohlig-Hellman algorithm? I don't understand how we are determining what the coefficients are. I understand that the prime value limits the numbers you can attain: 2-0 or 1, 3- 0,1,or 2. But I don't understand how/why we use that knowledge. Thank you :)

  • @parisanaraei
    @parisanaraei 9 років тому

    Perfect , thankssssss

  • @loliveira
    @loliveira 8 років тому

    clap clap clap!