Article Per Year (5 Year)
p-Index From 2021 - 2026
0.444
P-Index
This Author published in this journals
All Journal Polygon: Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Mars: Jurnal Teknik Mesin, Industri, Elektro dan Ilmu Komputer
Aulia Kartika Dewi
Unknown Affiliation
Computer Science & IT

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

Found 2 Documents
Search

 1 
Rancangan Aplikasi Pemesanan Makanan dan Minuman di Mona Cafe Berbasis Desktop dalam Pemrograman Berbasis Objek dengan Menggunakan Netbeans Aulia Kartika Dewi
Mars : Jurnal Teknik Mesin, Industri, Elektro Dan Ilmu Komputer Vol. 3 No. 1 (2025): Jurnal Teknik Mesin, Industri, Elektro Dan Ilmu Komputer
Publisher : Asosiasi Riset Teknik Elektro dan Informatika Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61132/mars.v3i1.729

Abstract

Technological advancements encourage the culinary business sector to adopt digital systems to improve operational efficiency. One such innovation is a desktop-based food ordering application. Mona Cafe in Medan developed this system to make it easier for customers to place orders without waiting long or writing them down manually. This application allows customers to select menus digitally, making the ordering process more practical and efficient. Additionally, it helps waiters record and manage orders more systematically, reducing errors and speeding up service. This technology also aligns with the digitalization trend, especially in attracting millennials and Gen Z. Besides enhancing customer convenience, this application helps Mona Cafe stay competitive in the growing culinary business. Developed using the waterfall method, the system makes cafe operations more structured and professional. With this innovation, Mona Cafe is expected to improve its service quality and customer satisfaction
Perbandingan Waktu Pemecahan Password Menggunakan Algoritma Hash MD5, SHA-256, dan SHA-512 pada Serangan Brute Force Nur Bainatun Nisa; Noni Fauzia Rahmadani; Aulia Kartika Dewi; Luftia Rahma Nasution; Dzilhulaifa Siregara; Rifdah Syahputri; Ibnu Rusydi
Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 1 (2026): Januari : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam
Publisher : Asosiasi Riset Ilmu Matematika dan Sains Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.62383/polygon.v4i1.926

Abstract

Password security is a critical component in protecting information systems, as passwords are often the primary target of various attacks, particularly brute force attacks. A brute force attack works by systematically attempting all possible character combinations until the correct password corresponding to a stored hash value is found. Therefore, the choice of an appropriate hash algorithm plays a significant role in determining a system’s resistance to such attacks. This study aims to analyze and compare the password cracking time of MD5, SHA-256, and SHA-512 hash algorithms under brute force attack scenarios. The research methodology involves generating hash values from a set of test passwords using each hash algorithm, followed by conducting brute force attacks to recover the original passwords based on the generated hash values. The collected data are analyzed by measuring the time required to crack passwords for each algorithm. The results indicate that MD5 has the fastest cracking time compared to SHA-256 and SHA-512, indicating a lower level of resistance to brute force attacks. SHA-256 demonstrates better security than MD5 but remains less resistant when compared to SHA-512. The SHA-512 algorithm requires the longest cracking time, reflecting the highest level of resistance to brute force attacks among the tested algorithms. In conclusion, hash algorithms with larger bit lengths provide stronger protection against brute force attacks and are more suitable for secure password storage in information systems.
Co-Authors Dzilhulaifa Siregara Ibnu Rusydi Luftia Rahma Nasution Noni Fauzia Rahmadani Nur Bainatun Nisa Rifdah Syahputri