Applied Cryptography: The Discrete Log Problem - Part 3

Поділитися
Вставка
  • Опубліковано 13 гру 2024

КОМЕНТАРІ • 13

  • @adbd4477
    @adbd4477 6 років тому +2

    This series of videos is fantastic!

  • @Noskur
    @Noskur 4 роки тому +2

    This helped me a lot in my number theory studies. Great work!

  • @IODell
    @IODell 3 роки тому

    Great series on DLP's. Thank you.

  • @franzbaum9418
    @franzbaum9418 7 років тому +3

    Thank you for this fabulous explanation! Really clear style of explaining and a great balance between repetition and proceeding!
    Just came over from the Computerphile Diffi-Hellman videos and really appreciate your work.

  • @rezatavakol2531
    @rezatavakol2531 2 роки тому

    Great explanation! Tanks

  • @Max-eo6vx
    @Max-eo6vx 4 роки тому +1

    Super Leandro!

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

    very well described with examples thankyou

  • @abhisheksolutions3368
    @abhisheksolutions3368 7 років тому +1

    Thanks for such detailed vdo's

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

      You are welcome!, I am glad the videos are helpful :)

  • @gollumei
    @gollumei 4 роки тому +2

    At 10:10 shouldn't the fact be that "the difficulty of finding loga(b) is NOT independent of a"? Because the difficulty of finding x is not just dependent on the generator a, but also the large prime number p?

    • @leandrojunes7091
      @leandrojunes7091  3 роки тому +1

      Yes, it is because it depends on,y on the prime number. Another way to see it is that you can change the base of the logarithm, so changing the base does not affect the difficulty of the problem.

  • @nilsguitarsandmandolins5662
    @nilsguitarsandmandolins5662 4 роки тому

    Thank you!