Digital Signature Algorithm (DSA) explained with example - Daniel's Security Academy

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

КОМЕНТАРІ • 11

  • @danielssecurityacademy
    @danielssecurityacademy  2 роки тому +1

    In this video I covered more the mathematical side of things for DSA rather than talking about the systematic approach or the actual implementations into IT systems. Would you love to see a follow-up on this end as well?

  • @sh_412
    @sh_412 11 місяців тому +6

    Calculation of r at 13:11 is wrong , g =2 , so r would end up being 8 right

  • @thulasimadhan3933
    @thulasimadhan3933 11 місяців тому +1

    209952 mod 23 = 8 correct me if iam wrong

  • @timoranta-ojala9074
    @timoranta-ojala9074 Рік тому +1

    In 10.00 g value was 2 but in point 13.00 changed to 11.....

  • @christiancyizam7827
    @christiancyizam7827 2 роки тому +1

    Thank you!! It is well explained now I ve got all I needed about DSA

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

      You are welcome! Let me know if you want some more protocols or algorithms explained and I will try to fit it into my pipeline :)

  • @phangiang3788
    @phangiang3788 Рік тому +1

    Sir, how did you find H(m) = 3

    • @danielssecurityacademy
      @danielssecurityacademy  Рік тому +1

      In this example it was simply picked. H(m) is the hash function result "H" on the message "(m"). It could be anything depending on your actual message and chosen hash function. I used 3 as a number here to make the calculation easier :)

  • @jordankheambo7290
    @jordankheambo7290 2 роки тому +1

    how can we calculate the time elapsed for the different cryptography algorithms or the decryption/encryption time

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

      You can write a small program in C for example by starting a timer before calling the encryption/decryption function and stop the timer afterwards. Simply print out the elapsed time and you have a rough idea of the time consumption of the algorithms. For sure this measurement is not perfect, but an easy starting point for a rough idea.

  • @kenyatodaynews254
    @kenyatodaynews254 10 місяців тому

    g=2 not 11, why change it to 11 in the signing process?????