Claim Missing Document
Check
Articles

Found 2 Documents
Search

ANALISIS DATA MINING ALGORITMA C-45 DALAM MENENTUKAN PRODUK YANG BANYAK DIMINATI PADA TOKO BILLY. Noni Rahmawati; Arif Setiadi; Tomi Kurniawan; Rio Ramadani
Djtechno: Jurnal Teknologi Informasi Vol 4, No 2 (2023): Desember
Publisher : Universitas Dharmawangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46576/djtechno.v4i2.4061

Abstract

Toko Billy merupakan toko yang menjual produk makanan tradisional menggunakan sistem manual(dor to dor, wa, dan facebook). Metode yang di gunakan dalam penelitian ini yaitu metode data mining algoritma C-45 dengan aplikasi Weka sebagai media software komputernya untuk mengetahui produk apa saja yang banyak diminati pada toko Billy. Aplikasi weka digunakan untuk mengetahuin produk yang diminati, yang kurang diminati dan tidak diminati oleh konsumen atau masyarkat yang membeli di toko tersebut, sehingga pihak toko bisa lebih banyak memproduksi produk yang diminati dan menguranngi produk yang kurang diminati dan tidak diminati sama sekali, agar penjualan produk lebih baik lagi dan meningkatkan Income (pendapatan) serta mengurangi kerugian yang dapat terjadi pada too billy. Kata kunci : Manual, Income, Data Mining algoritma C-45, Weka
Security and Performance Analysis of Caesar and Vigenère Ciphers Yandi Anzari; Teuku Djauhari; Tomi kurniawan; Noni Rahmawati; Niko Akbar
Journal of Intelligent Systems and Information Technology Vol. 3 No. 2 (2026): July
Publisher : Apik Cahaya Ilmu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61971/jisit.v3i2.320

Abstract

While most cryptographic benchmarks prioritize modern algorithms, this study offers a distinct, controlled evaluation of classical monoalphabetic versus polyalphabetic substitution ciphers under systematically scaled data workloads up to 1,000 KB. The objective is to quantify the exact execution throughput and security thresholds of the Caesar and Vigenère ciphers against contemporary automated attacks. The methodology utilizes programmatically built Python modules tested across 100 continuous trials inside an isolated Linux environment, subjected to automated brute-force scripts and statistical Kasiski examinations. The empirical results reveal that both algorithms exhibit linear time complexity, though the Vigenère cipher suffers a 38% to 45% performance overhead due to index alignment. Crucially, while the Vigenère cipher successfully deters primitive brute-force attacks, its structural security collapses catastrophically with a 100% vulnerability rate under statistical cryptanalysis once the file size reaches 50 KB. The practical implication dictates that polyalphabetic substitution provides superficial protection against modern computing power, reinforcing institutional policy to restrict these foundational algorithms exclusively to pedagogical frameworks rather than active information systems.