Articles
<![CDATA[Impelementasi Data Mining terhadap Evaluasi Kinerja Guru dalam Mengajar Menggunakan Metode Naive Bayes Classifier ]]>
<![CDATA[Sriani]]>;
<![CDATA[Rusydi, Ibnu]]>;
<![CDATA[Nur Aisyiyah, Siti R]]>
<![CDATA[ VISA: Journal of Vision and Ideas Vol. 4 No. 1 (2024): VISA: Journal of Vision and Ideas ]]>
Publisher : <![CDATA[IAI Nasional Laa Roiba Bogor ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.47467/visa.v4i1.1274
<![CDATA[Teachers are an important resource in supporting the teaching and learning process. The quality of teachers needs attention because it determines the quality of the teaching and learning process. This research aims to create a system that is able to classify performance as Very Good, Good, and Fair as seen from Pedagogical Competency, Personality Competency, Social Competency, Professional Competency using Naive Bayes Classifier calculations. Implementation of the Naive Bayes Classifier classification using numerical calculations. Based on a dataset divided into 80 training data and 20 testing data, the final test calculation achieved an accuracy level of 85% with precision results of 60% then recall of 57.14%. After carrying out calculations and obtaining test results, they will be distributed into the system using PHP and MySQL which are designed to carry out teacher performance assessment classifications. The prediction results obtained from the system are consistent with the results of manual calculations. Based on the research conducted, the system developed can be implemented in a way that makes it easier to evaluate teaching effectiveness.]]>
<![CDATA[Hybrid DAC-GA and K-Means for Spatial Clustering of Stunting Risk in North Sumatra ]]>
<![CDATA[Andy Satria]]>;
<![CDATA[Ibnu Rusydi]]>;
<![CDATA[Dian Septiana]]>;
<![CDATA[Fanny Ramadhani]]>
<![CDATA[ Jurnal Sistem Komputer dan Informatika (JSON) Vol. 7 No. 1 (2025): September 2025 ]]>
Publisher : <![CDATA[Universitas Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.30865/json.v7i1.9071
<![CDATA[Stunting continues to pose a severe global health concern, particularly in Indonesia, where prevalence rates persist above international standards despite recent advances in reduction initiatives. Accurately documenting the regional variation of stunting is critical to facilitate targeted interventions and successful policymaking. This paper offers a hybrid clustering framework that merges the classic K-Means approach with the Dynamic Artificial Chromosomes Genetic approach (DAC-GA) to increase the resilience and reliability of spatial analysis. The dataset used combines demographic and population statistics from the Central Bureau of Statistics (BPS), strategic policy documents from the Regional Medium-Term Development Plan (RPJMD) of North Sumatra, and health indicators including stunting prevalence data from the Ministry of Health of the Republic of Indonesia. The research approach consists of four primary phases: data preparation, clustering model construction, cluster evaluation, and geographical visualization. Three evaluation metrics Sum of Squared Errors (SSE), Davies–Bouldin Index (DBI), and Silhouette Coefficient were applied to validate clustering performance. Results demonstrate that DAC-GA dynamically determined the ideal number of clusters at k=2 in just 1.171677 seconds, classifying Kota Medan and Deli Serdang into the low-risk cluster, while all other districts were consistently put into the high-risk cluster. Both DAC-GA and standard K-Means yielded similar spatial maps, giving significant methodological validation and strengthening the dependability of the findings. The study reveals not just the technical advantages of DAC-GA in maximizing clustering but also its practical utility in guiding spatially targeted health interventions. Future research is recommended to add dimensionality reduction utilizing Principal Component Analysis (PCA) to improve computing efficiency and enhance the interpretability of clustering results.]]>
<![CDATA[TEKNIK STEGANOGRAFI DISCRETE COSINE TRANSFORM DAN ALGORITMA RSA UNTUK MENYISIPKAN PESAN PADA AUDIO ]]>
<![CDATA[Apriani, Puja]]>;
<![CDATA[Hasugian, Abdul Halim]]>;
<![CDATA[Rusydi, Ibnu]]>
<![CDATA[ JSR : Jaringan Sistem Informasi Robotik Vol 8, No 1 (2024): JSR: Jaringan Sistem Informasi Robotik ]]>
Publisher : <![CDATA[AMIK Mitra Gama ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.58486/jsr.v8i1.319
<![CDATA[Transmisi informasi menjadi lebih umum, yang dapat membahayakan keaslian dan integritas pesan. Pesan yang sangat pribadi atau sensitif seringkali diinginkan oleh individu. Untuk melindungi pesan pribadi dan sensitif, diperlukan sistem keamanan data. sehingga mereka yang berhak menerimanya dapat melakukannya. Salah satunya melalui penggunaan metode yang dikenal dengan kriptografi dan steganografi, yang dimana pesan tersebut dienkripsi terlebih dahulu menjadi karakter yang tidak bermakna kemudian disisipkan pada wadah penampung. Metode Kriptografi yang digunakan ialah Algoritma RSA. Kesulitan mengubah bilangan besar menjadi faktor prima untuk mendapatkan keamanan pada algoritma RSA terletak pada kunci publik dan private. Namun, Algoritma Kriptografi ini memiliki kelemahan dalam penerapannya yaitu mudah menimbulkan konflik karena pesan diubah atau diacak menjadi bentuk yang tidak bermakna. Untuk menghindari kekurangan dari algoritma kriptografi yang digunakan, keberadaan pesan perlu disembunyikan untuk menjaga kerahasiaan pesan. Maka, penulis menggunakan pendekatan steganografi dan kriptografi. Metode Steganografi yang digunakan adalah metode transformasi yang bekerja dengan melakukan transformasi audio kemudian dilakukan modifikasi terhadap koefisien DCT sesuai dengan bit pesan yang disisipkan. Pesan yang disembunyikan ialah pesan teks biasa yang disisipkan pada audio (*.wav) diimplementasikan dengan bantuan Microsoft Visual Studio 2012. Sistem penanaman dengan teknik DCT menghasilkan suara Stegano yang tidak terlalu mempengaruhi kualitas suara, hanya naik 1kb untuk size audio dibawah 2mb dan menghasilkan proses pemulihan pesan sebagai pesan secara efektif dikembalikan seperti semula.]]>
<![CDATA[IMPLEMENTASI METODE WATERFALL DALAM PERANCANGAN APLIKASI PENGELOLAAN PEGAWAI BERBASIS WEB PADA PERUSAHAAN ]]>
<![CDATA[Atoriq, Muhammad Agit]]>;
<![CDATA[Rusydi, Ibnu]]>;
<![CDATA[Rahman, M Arif]]>
<![CDATA[ CompTech : Jurnal Ilmu Komputer dan Teknologi Vol 2, No 1 (2025): September ]]>
Publisher : <![CDATA[Compart Digital ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.63854/comptech.v2i1.74
<![CDATA[PT. Patra Niaga sebagai anak perusahaan PT. Pertamina (Persero) memiliki peran penting dalam pendistribusian energi nasional, khususnya bahan bakar minyak. Kegiatan operasional yang melibatkan pekerjaan berisiko tinggi menuntut adanya sistem pengajuan izin kerja yang efisien dan aman. Namun, proses perizinan kerja yang masih dilakukan secara manual menimbulkan sejumlah permasalahan seperti keterlambatan persetujuan, miskomunikasi antar tim, hingga tidak tersimpannya data pekerjaan secara optimal. Hal ini berpotensi meningkatkan risiko kecelakaan kerja dan menurunkan efisiensi operasional perusahaan. Untuk mengatasi permasalahan tersebut, penelitian ini mengusulkan pengembangan sistem informasi berbasis web berupa Work Management System (WMS). Sistem ini dirancang untuk memfasilitasi pengajuan, verifikasi, dan pemantauan izin kerja secara digital dan real time. Dengan sistem ini, proses administrasi menjadi lebih cepat, transparan, dan terdokumentasi dengan baik, serta memungkinkan manajemen melakukan kontrol dan pengawasan secara efisien. Teknologi ini juga meminimalisir kesalahan komunikasi dan kehilangan data, serta mendukung pemenuhan standar keselamatan kerja. Hasil dari implementasi sistem menunjukkan bahwa proses pengajuan izin kerja dapat dilakukan lebih efisien dan terdokumentasi dengan baik. Sistem juga meningkatkan efektivitas komunikasi antara tim lapangan dan kantor, serta mempermudah pelacakan progres pekerjaan.]]>
<![CDATA[Sistem Informasi Perpustakaan Berbasis Web di MA Teladan Medan ]]>
<![CDATA[Prayoga, J.]]>;
<![CDATA[Hasugian, Buyung Solihin]]>;
<![CDATA[Zulham, Zulham]]>;
<![CDATA[Rusydi, Ibnu]]>
<![CDATA[ DEVICE : JOURNAL OF INFORMATION SYSTEM, COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Vol 6, No 2: DESEMBER 2025 ]]>
Publisher : <![CDATA[Universitas Dharmawangsa ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.46576/device.v6i2.7765
<![CDATA[Penelitian ini bertujuan untuk merancang dan membangun sistem informasi perpustakaan berbasis web di MA Teladan Medan. Metode penelitian menggunakan pendekatan pengembangan sistem dengan teknik pengumpulan data melalui wawancara dan observasi. Perancangan sistem menggunakan Unified Modeling Language (UML) yang meliputi use case diagram, class diagram, sequence diagram, dan activity diagram. Sistem dibangun menggunakan framework CodeIgniter dengan bahasa pemrograman PHP dan database MySQL. Hasil penelitian menunjukkan bahwa sistem informasi perpustakaan berbasis web dapat mengatasi permasalahan pencatatan manual yang tidak efektif, mempercepat proses pencarian data buku, dan mengorganisasi kategori buku dengan lebih baik. Sistem ini memfasilitasi pengelolaan data buku, data anggota, transaksi peminjaman dan pengembalian, serta pembuatan laporan secara terkomputerisasi. Implementasi sistem memberikan efisiensi operasional, kemudahan akses informasi, dan peningkatan kualitas layanan perpustakaan sekolah.]]>
<![CDATA[Implementasi Algoritma Caesar Cipher untuk Enkripsi dan Dekripsi Pesan ]]>
<![CDATA[Siti Fadiyah Nabila]]>;
<![CDATA[Maisyarah Maisyarah]]>;
<![CDATA[Zahara Vonna]]>;
<![CDATA[Salsabila Arifa Hasibuan]]>;
<![CDATA[Silfia Rahmadani Sitorus]]>;
<![CDATA[Aninda Evioni]]>;
<![CDATA[Ibnu Rusydi]]>
<![CDATA[ Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 1 (2026): Januari : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam ]]>
Publisher : <![CDATA[Asosiasi Riset Ilmu Matematika dan Sains Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.62383/polygon.v4i1.925
<![CDATA[Information security is an essential aspect of digital communication, particularly in the exchange of text-based messages through open networks. Messages transmitted without protection are vulnerable to interception and unauthorized modification. One classical cryptographic technique that remains relevant as a foundational learning tool is the Caesar Cipher algorithm. This study aims to implement the Caesar Cipher algorithm for message encryption and decryption and to analyze its effectiveness and security level. The research method employed is a descriptive approach through literature review and a case study by applying character-shift techniques to text messages. The results indicate that the Caesar Cipher algorithm successfully transforms plaintext into ciphertext and restores it back to its original form through the decryption process. Although the algorithm is simple and easy to implement, it has significant limitations in terms of security due to its small key space and vulnerability to brute-force attacks. Therefore, Caesar Cipher is not suitable for protecting sensitive data but remains valuable as an introductory model for understanding basic cryptographic concepts.]]>
<![CDATA[Perbandingan Waktu Pemecahan Password Menggunakan Algoritma Hash MD5, SHA-256, dan SHA-512 pada Serangan Brute Force ]]>
<![CDATA[Nur Bainatun Nisa]]>;
<![CDATA[Noni Fauzia Rahmadani]]>;
<![CDATA[Aulia Kartika Dewi]]>;
<![CDATA[Luftia Rahma Nasution]]>;
<![CDATA[Dzilhulaifa Siregara]]>;
<![CDATA[Rifdah Syahputri]]>;
<![CDATA[Ibnu Rusydi]]>
<![CDATA[ Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 1 (2026): Januari : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam ]]>
Publisher : <![CDATA[Asosiasi Riset Ilmu Matematika dan Sains Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.62383/polygon.v4i1.926
<![CDATA[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.]]>
<![CDATA[Keamanan Data melalui Enkripsi Studi Kasus dengan Algoritma RSA ]]>
<![CDATA[Salsabila Putri Hati Siregar]]>;
<![CDATA[Nur Aisyah Pandia]]>;
<![CDATA[Putri Ramadani]]>;
<![CDATA[Ibnu Rusydi]]>
<![CDATA[ Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 1 (2026): Januari : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam ]]>
Publisher : <![CDATA[Asosiasi Riset Ilmu Matematika dan Sains Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.62383/polygon.v4i1.929
<![CDATA[Data security is a critical aspect in the digital era due to the increasing exchange of sensitive information through electronic media. One widely used approach to protect data confidentiality is cryptography, particularly asymmetric encryption algorithms. This study aims to analyze the implementation of the Rivest–Shamir–Adleman (RSA) algorithm as a data security mechanism through an encryption and decryption process. The research method used is an experimental approach by implementing the RSA algorithm in a text-based data security simulation. The stages include key generation, encryption, and decryption processes, followed by analysis of the correctness and effectiveness of the algorithm in maintaining data confidentiality. The results show that the RSA algorithm is capable of converting plaintext into unreadable ciphertext and successfully restoring it to its original form through the decryption process using the correct private key. This confirms that RSA provides a high level of security based on the difficulty of factoring large prime numbers. The implication of this study is that the RSA algorithm can be effectively applied to secure sensitive data transmission in information systems, especially in environments requiring strong authentication and confidentiality.]]>
<![CDATA[Pembatasan Laju Adaptif Berbasis Verifiable Delay Function untuk Mitigasi Penyalahgunaan API pada Gateway Edge Ringan ]]>
<![CDATA[Diah Putri Kartikasari]]>;
<![CDATA[Tiara Ayu Triarta Tambak]]>;
<![CDATA[Agung Nugroho]]>;
<![CDATA[Ibnu Rusydi]]>
<![CDATA[ Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam Vol. 4 No. 1 (2026): Januari : Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam ]]>
Publisher : <![CDATA[Asosiasi Riset Ilmu Matematika dan Sains Indonesia ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.62383/polygon.v4i1.931
<![CDATA[API abuse on lightweight edge gateways has intensified as microservice-based services expose many REST endpoints to heterogeneous clients. Conventional per-identity rate limiting, such as static token buckets, is frequently bypassed through distributed bots and identity rotation, while legitimate burst traffic may be rejected and degrade user experience. This study proposes Adaptive Rate Limiting with Verifiable Delay Functions (ARL-VDF), which couples a lightweight risk score with selective VDF challenges to impose a tunable sequential-computation cost on suspicious clients without forcing aggressive dropping for low-risk users. The gateway continuously derives a per-identity risk score from short-window request rate, error tendency, and identity freshness, then maps the score to a target delay bounded by and . Evaluation uses a 600-second discrete-event simulation on a mixed workload consisting of normal clients, legitimate bursts, and distributed attackers. Compared with a static token bucket baseline, ARL-VDF maintains full success for legitimate traffic, reduces attacker throughput that passes the gateway, and keeps verification overhead within a fixed budget on the edge device. The results indicate that combining adaptive control with verifiable sequential cost can improve availability and fairness on resource-constrained edge gateways without resorting to aggressive dropping.]]>
<![CDATA[PERBANDINGAN ALGORITMA DES, AES, IDEA, DAN BLOWFISH BERDASARKAN PANJANG KUNCI DAN CIPHERTEXT SEBAGAI INDIKATOR KEAMANAN DATA ]]>
<![CDATA[Faqih Rifaldy]]>;
<![CDATA[Hans Pran Limbong]]>;
<![CDATA[Maulana Firjatullah]]>;
<![CDATA[Rafli Arya Gading]]>;
<![CDATA[M Irsan Prayoga]]>;
<![CDATA[Ibnu Rusydi]]>
<![CDATA[ Journal of Research and Publication Innovation Vol 4 No 1 (2026): JANUARY ]]>
Publisher : <![CDATA[Journal of Research and Publication Innovation ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
<![CDATA[The rapid growth of information technology has increased the need for secure data transmission, making cryptography a fundamental component of computer security systems. Symmetric cryptographic algorithms play an important role in protecting data confidentiality by transforming plaintext into ciphertext that is difficult to interpret by unauthorized parties. This study aims to compare the symmetric cryptographic algorithms DES, AES, IDEA, and Blowfish based on key length and ciphertext length as indicators of data security. The research utilizes a dataset consisting of 120,000 encryption records containing information on algorithm type, key length, and ciphertext length. The analysis is conducted using a descriptive comparative approach to evaluate differences in security characteristics among the algorithms. Key length is analyzed as an indicator of resistance to brute-force attacks, while ciphertext length is examined to assess encryption complexity and data transformation behavior. The results show that DES has the shortest key length and produces relatively less complex ciphertext, indicating lower security. IDEA demonstrates moderate security characteristics, while AES and Blowfish exhibit larger and more flexible key lengths along with more varied ciphertext patterns. These characteristics suggest that AES and Blowfish provide higher security compared to DES and IDEA. This study concludes that key length and ciphertext characteristics can be used as preliminary indicators in evaluating the relative security of symmetric cryptographic algorithms. However, this research does not include performance testing or cryptanalysis simulations, which can be explored in future studies.]]>
