Khoironi
Politeknik Elektronika Negeri Surabaya

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Comparative Analysis of RSA-2048, ECDSA-P256, and Ed25519 Digital Signatures in Document Authentication Systems I Wayan Rangga Pinastawa; Khoironi; Tomi Tri Sujaka
Informatik : Jurnal Ilmu Komputer Vol 22 No 2 (2026): August 2026
Publisher : Fakultas Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52958/iftk.v22i2.14719

Abstract

Digital signatures are widely used to ensure the authenticity, integrity, and non-repudiation of digital documents. This study aims to compare the performance of RSA-2048, ECDSA P-256, and Ed25519 algorithms in digital document authentication. The dataset consisted of 500 text documents with file sizes ranging from 1 KB to 10 MB. The evaluation was conducted based on key generation time, signing time, verification time, signature size, and tampering detection capability. Each signing and verification process was repeated 10 times, resulting in a total of 15,000 observations. The experimental results show that Ed25519 achieved the fastest signing time of 0.000027 seconds and the smallest signature size of 64 bytes. RSA-2048 achieved the fastest verification time of 0.000025 seconds, while ECDSA P-256 provided intermediate performance between the two algorithms. Tampering detection tests demonstrated that all algorithms successfully detected document modifications with a 100% detection rate. Statistical analysis using the Kruskal–Wallis and Mann–Whitney U tests confirmed significant performance differences among the evaluated algorithms, with a very large effect size (η² = 0.682). Based on the obtained results, Ed25519 was found to be the most efficient algorithm for digital document authentication systems requiring high performance and compact signature sizes.