What Are Three Nist Approved Digital Signature Algorithms Choose Three

How to eSign a document: Digital signature algorithms

hello and welcome again and this video will discuss another signature algorithm this called the DSA will is call like that is because digital signature algorithm this is actually an in standard that was adopted by the US government a while ago and this is a very popular algorithm to sign data or documents in that case so what we're going to do is we're going to look at first the key generation for the digital signature algorithm and remember these algorithms are all based on the a symmetric idea which is you always have a public key in a private key so the key generation that we're going to look at this this moment is for date 1024 bits which can be done also for other other sizes so this is the recommended size at 1024 just for security reasons and this algorithms the security of them is also a based on the fact of the logarithm problem which is if you have a efficient algorithm to do these computations for logs then all of this will not work so let's look at at the data generation for the DSA so the key generation for the DSA the person or the entity that is going to do the accumulation is the person who is interested in signing the messages which in this case so we're talking about Bob would be the one in this case they generate the public key and the private keys and I remember the public key is used to check that the signature is valid and the private key is the one that Bob's keep secret so he is the only one who can sign messages on his behalf so I'm going to go right into the algorithm and see how this is so the algorithm is going to start like this so we're going to first step one we're going to select a prime number cube and that prime number Q is going to be between two to the 159 and to the 160 now that assures that this number Q here it has a bit length of 160 so that's why we put this restrictions here we want all the way to say just say Q has a bit length of 160 that's equivalent to saying this inequality here so we're going to select that Prime we're going to select another prime number which is going to be of actually length 1024 so we select the prime number P with the following properties there are two things I have to happen here so the prime P as I mentioned has to be of length 1024 that's why we have these inequalities over here PBR done two to the ten twenty three and less than two to the ten twenty four and also another important property is that the prime number that you previously chose which is this Q that is 160 bit length needs to divide the P minus one so whatever P...