Verifikasi Tanda Tangan Elektronik dengan Teknik Otentikasi Berbasis Kriptografi Kunci Publik Sistem Menggunakan Algoritma Kriptografi Rivest-Shamir-Adleman
Melina Melina, F. Sukono, Herlina Napitupulu, Valentina Adimurti Kusumaningtyas
{"title":"Verifikasi Tanda Tangan Elektronik dengan Teknik Otentikasi Berbasis Kriptografi Kunci Publik Sistem Menggunakan Algoritma Kriptografi Rivest-Shamir-Adleman","authors":"Melina Melina, F. Sukono, Herlina Napitupulu, Valentina Adimurti Kusumaningtyas","doi":"10.24198/jmi.v18.n1.38343.27-39","DOIUrl":null,"url":null,"abstract":"To suppress the spread of COVID-19, almost all countries have been locked down. Most activities become work from home (WFH) so that triggers an increase in online transactions. Online transactions in-volving critical information require an electronic signature (DS), which is an authentication and verification tool. A fast and accurate pro-cess of sender legitimacy, authenticity, and anti-disclaimer is a must. The procedures used to prove the authenticity of DS, authenticity of the signer’s identity, and anti-repudiation can be carried out with authentication techniques. The purpose of this study is to propose a DS verification with an authentication technique based on system public-key cryptosystems by reversing the role of the private key and public key in the Rivest-Shamir-Adleman cryptographic algorithm. The electronic information attached to the DS will be stored in the message M, using a hash function against M to produce h = H ( M ) . The value of h will be encrypted to be a DS with the private key PR ( d, n ) . The signature is verified to prove its authenticity by decrypting the DS using the public key PU ( e, n ) , thus obtaining the value of h. The value of h is compared with the value of h (cid:48) which is obtained from the value of the message hash function M of the examined DS. If h = h (cid:48) means the DS is authentic. If the digit size is d > e , the signing time is longer than the time required for verification, and vice versa.","PeriodicalId":53096,"journal":{"name":"Jurnal Matematika Integratif","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Matematika Integratif","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24198/jmi.v18.n1.38343.27-39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
To suppress the spread of COVID-19, almost all countries have been locked down. Most activities become work from home (WFH) so that triggers an increase in online transactions. Online transactions in-volving critical information require an electronic signature (DS), which is an authentication and verification tool. A fast and accurate pro-cess of sender legitimacy, authenticity, and anti-disclaimer is a must. The procedures used to prove the authenticity of DS, authenticity of the signer’s identity, and anti-repudiation can be carried out with authentication techniques. The purpose of this study is to propose a DS verification with an authentication technique based on system public-key cryptosystems by reversing the role of the private key and public key in the Rivest-Shamir-Adleman cryptographic algorithm. The electronic information attached to the DS will be stored in the message M, using a hash function against M to produce h = H ( M ) . The value of h will be encrypted to be a DS with the private key PR ( d, n ) . The signature is verified to prove its authenticity by decrypting the DS using the public key PU ( e, n ) , thus obtaining the value of h. The value of h is compared with the value of h (cid:48) which is obtained from the value of the message hash function M of the examined DS. If h = h (cid:48) means the DS is authentic. If the digit size is d > e , the signing time is longer than the time required for verification, and vice versa.