Digital signature authentication using Rivest-Shamir-Adleman cryptographic algorithm.

Currently, every electronic transaction involving important information requires a digital signature (DS). The procedure used to prove the authenticity of the DS, the authenticity of the sender's identity, and the non-repudiation of the DS can be carried out with authentication techniques. Signing the DS is done using a hash function. The message digest (MD) generated by the hash function (ℎ) will be encrypted by reversing the roles of the private and public keys in the Rivest-Shamir-Adleman (RSA) cryptographic algorithm. The main objective of this research is to propose DS authentication using the RSA algorithm. The signature is signed through MD encryption using the RSA algorithm using a private key PR{d, n}. The signature is verified by decrypting the DS using the public key PU{e, n}, thus getting the ℎ value. The h value is compared with the ℎ' value obtained from the value of the DI hash function of the checked DS. The result of this research is that the signature is verified to be authenticated, if the result is h = h′, then means that the received DS is genuine and comes from the signed user (user authentication), never modified (data integrity), and the sender can't deny the signature (non-repudiation). [ABSTRACT FROM AUTHOR]