Izvorni znanstveni članak
https://doi.org/10.32985/ijeces.13.9.1
Comparative Analysis between Elgamal and NTRU Algorithms and their implementation of Digital Signature for Electronic Certificate
Bambang Harjito
orcid.org/0000-0001-7118-3738
; Sebelas Maret University, Faculty of Math and Science, Informatics Study Program Surakarta, Indonesia
Tri Setyowati
Ardhi Wijayanto
orcid.org/0000-0001-6187-0593
Sažetak
The emergence of electronic certificates, which are official documents in the form of digital files transmitted via the internet, facilitates the exchange of information. However, internet use has risks, such as data theft for fabricating and modifying information. This problem can be solved by applying a digital signature. This problem can be solved by applying a digital signature. The main concern in this research is how to perform a comparative analysis between asymmetric cryptographic Elgamal and NTRU (Nth-Degree Truncated Polynomial Ring) algorithms and their implementation of a digital signature as an effort to improve information security in electronic certificates. The stages of the research method are divided into the key generation process, signing, and verification. In the signing and verification process, the SHA-512 hash function is also used for hashing messages to be encrypted-decrypted and QR Code as the signature.
Comparison of performance of NTRU with Elgamal algorithms required running at a pdf extension with security levels 80,128,192, 256 bits will be obtained from the templates.office.com website. The results obtained that the El Gamal algorithm is better than the NTRU algorithm, but at a higher security level, the NTRU algorithm is better than the Elgamal algorithm. In the verification experiment that has been carried out, it can be concluded that by using SHA-512 as a hash function, the N parameter used for NTRU must be greater than or equal to 512 to avoid error results from verification.
Ključne riječi
NTRU; Elgamal; Electronic Certificate; Digital Signature; SHA-512; QR Code;
Hrčak ID:
286267
URI
Datum izdavanja:
6.12.2022.
Posjeta: 313 *