Applied Cryptography: The Discrete Log Problem - Part 1

Поделиться
HTML-код
  • Опубликовано: 24 сен 2016
  • This video cover an introduction to the concepts related to the Discrete Log Problem.

Комментарии • 14

  • @reyhanehhassanzadeh3560
    @reyhanehhassanzadeh3560 3 года назад +1

    You are tremendously expert 👌

  • @sinbadgmail
    @sinbadgmail 4 года назад +1

    wow, wonderful explanation. thank you.

  • @SurSancho
    @SurSancho 5 лет назад

    Thanks

  • @Arktis86
    @Arktis86 7 лет назад

    Thank you!

  • @Dyaishk
    @Dyaishk 7 лет назад

    Thank you

  • @hichamloukili3910
    @hichamloukili3910 2 года назад

    thank you wow m9wdd 3chiri

  • @govindmaheshwari2935
    @govindmaheshwari2935 8 месяцев назад

    suppppeprrrr

  • @gollumei
    @gollumei 3 года назад

    CSC3621 students rise up!

  • @jsridhar72
    @jsridhar72 7 лет назад +2

    Confused explanation why 0 is excluded in ZP*

    • @leandrojunes7091
      @leandrojunes7091  7 лет назад +5

      Zero is excluded because you want every element in Zp* to have a multiplicative inverse. If we allow the zero in Zp*, then zero would not have a multiplicative inverse.

    • @nomads7978
      @nomads7978 6 лет назад +1

      Element under ZP* should be co-pime to p. GCD(0,p) is not co-prime. Hence we can't include 0 here