Claim Missing Document
Check
Articles

Found 3 Documents
Search

Perbandingan Performa Kecepatan dari Algoritma Hash Function untuk Proses Enkripsi Password Ahmad Miftah Fajrin
Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) Vol 4, No 4 (2023): Edisi Oktober
Publisher : LPPM STIKOM Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/kesatria.v4i4.256

Abstract

Hash Function is a crucial component in the field of cryptography. It is also utilized for authentication processes within a system. Authentication processes need to ensure both security and data processing speed. One vital component in the authentication process is the password. Password security can be enhanced through encryption using hash functions. Algorithms that can be employed include SHA-1 until SHA-3, MD5 and BLAKE2. Performance testing for execution speed and password comparison is conducted on these algorithms. The results indicate that the BLAKE2 algorithm has an average encryption time of 0.9857. Likewise, for the password comparison process, the BLAKE2 algorithm also exhibits a high speed with an average of 0.2230. As a result, the BLAKE2 algorithm is recommended for use in system authentication.
Perbandingan Performa dari Algoritma AES dan RSA dalam Keamanan Transaksi Ahmad Miftah Fajrin; Christoper Kelvin; Brian Owen; Bayu Aji
Kesatria : Jurnal Penerapan Sistem Informasi (Komputer dan Manajemen) Vol 5, No 2 (2024): Edisi April
Publisher : LPPM STIKOM Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/kesatria.v5i2.379

Abstract

Online transactions have become increasingly prevalent in the modern day. It is highly user-friendly and can be conveniently transported to any location. Nevertheless, internet transactions possess inherent security vulnerabilities that render them susceptible to assaults, hence enabling the retrieval of consumers' personal data. Hence, it is imperative to use encryption measures for safeguarding users' personal data, including PINs, CVVs, and card numbers. This study aims to evaluate and contrast the efficacy of AES and RSA algorithms within a website platform designed for online transactions. The study's findings indicate that there is minimal disparity in the performance of the two algorithms. However, it was observed that both algorithms exhibit enhanced security when employing longer keys.
Analisis Performa dari Algoritma Kriptografi RSA dan ElGamal dalam Enkripsi dan Dekripsi Pesan Ahmad Miftah Fajrin; Jeremy Richard Benedict; Henri Jayanata Kusuma
Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) Vol 8, No 1 (2023): Edisi Februari
Publisher : STIKOM Tunas Bangsa Pematangsiantar

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/jurasik.v8i1.545

Abstract

Cryptography is one of the most important things in computer science because it is related to data security or message security. Cryptographic algorithms are used to secure a message, the most popular of which are the Rivest-Shamir-Adleman (RSA) and ElGamal algorithms. ElGamal employs a prime number modulo while RSA employs the factorial of two large integer numbers. The workings of these two algorithms are distinct, and each has distinct advantages. Even though the two algorithms use different processes, they can both encrypt and decrypt a message. There are speed factors of execution time and peak memory when running the encryption and decryption process. One of these two factors is hardware, which determines the environment that will be used. According to the findings of this study, the RSA algorithm has a faster execution time than ElGamal. In terms of peak memory, both algorithms get the result similarly, with the same peak memory results shown..