Signcryption Berkas Digital dengan Algoritma Benaloh dan Elgamal Signature Scheme

Abstract

The rapid advancement of technology makes it easier for individuals to send files digitally, but it also increases cases of file forgery and duplication, for example in the evoting process. To prevent this, it is necessary to implement a cryptographic system, one of which is through signcryption. E-voting emphasizes authentication, data integrity, and confidentiality. Therefore, research was conducted on the Benaloh and ElGamal Signature Scheme algorithms in signcryption methods to overcome these problems and provide integrity, confidentiality, and authentication to e-voting data transmission. Both signature schemes use the modular exponential method, which is more efficient than the RSA factorization. The final results show the success of the signcryption process with test results in the form of running time of each Signcription process for each file type and size and cryptanalysis testing with Brute Force Attack.