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

After covering asymmetric encryption in general, the RSA and Diffie-Hellman algorithm as well, this session will cover the Digital Signature Algorithm (DSA) in specific. We are running an own example to demonstrate how to use all the formulars and what is behind the computation of a digital signautre. Feel free to ask or comment in the comment section below and give me feedback of what I can improve on or what I should cover in the next sessions.

Feel free to connect with me:
Instagram: @danielschmalen

#security #itsecurity #it #cybersecurity #cyber #university #academy #learning #networks #timetolearn #onlinelearning #onlinetutor #interactivelearning #elearning #asymmetric #encryption #rsa #dh #diffiehellman #dsa #digitalsignaturealgorithm #example #explained
University icons created by Freepik - Flaticon

[danielssecurityacademy]

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_]

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

[christiancyizam]

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

[timoranta-ojala]

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

[thulasimadhan]

209952 mod 23 = 8 correct me if iam wrong

[jordankheambo]

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

[respectytshorts]

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