Article Per Year (5 Year)
p-Index From 2021 - 2026
2.56
P-Index
This Author published in this journals
All Journal JURNAL AKADEMIKA Fortech : Journal of Information Technology Jurnal Teknologi Informasi dan Pendidikan Jurnal Manajemen Informatika Jayakarta Djtechno: Jurnal Teknologi Informasi KNOWLEDGE: Jurnal Inovasi Hasil Penelitian dan Pengembangan JURNAL TEKNOLOGI INFORMASI & KOMUNIKASI DALAM PENDIDIKAN Akademika Fortech : Journal of Information Technology
Ezrifal Sany
Universitas Nurdin Hamzah
Arts Astronomy Biochemistry, Genetics & Molecular Biology Chemistry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Immunology & microbiology Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Other

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

Found 42 Documents
Search

 1   2   3   4   5 
APLIKASI JADWAL DAN PENILAIAN SKRIPSI UNIVERSITAS NURDIN HAMZAH: Web-Based Application,  Thesis Scheduling,  Thesis Assessment, Academic Information System,  User Acceptance Test (UAT) Sany, Ezrifal
JURNAL AKADEMIKA Vol 18 No 1 (2025): Jurnal Akademika
Publisher : LP2M Universitas Nurdin Hamzah

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.53564/7zqzxz06

Abstract

This research aims to develop a web-based application to support the scheduling and assessment of thesis defenses at Universitas Nurdin Hamzah. The current scheduling process is conducted manually, often resulting in conflicts between supervisors, examiners, rooms, and students. In addition, thesis assessment is still carried out using printed forms, which are prone to recording errors and delays in result compilation. The developed application was designed to address these issues by providing two main modules, namely a thesis scheduling module and a thesis assessment module. The development methodology applied the System Development Life Cycle (SDLC) with a Waterfall approach, covering requirement analysis through system testing. The system was evaluated using black-box testing for functionality validation and a User Acceptance Test (UAT) involving 30 respondents, including lecturers, students, and academic staff. The results showed that 92% of the system’s functions performed as expected, while user satisfaction reached 90%. Furthermore, the application successfully accelerated the scheduling process by up to 60% compared to manual methods. Therefore, this application improves efficiency, accuracy, and transparency in managing thesis defenses.
EVALUASI KINERJA KOMPUTASI DAN KRIPTANALISIS BRUTE FORCE PADA ALGORITMA CAESAR CIPHER BERBASIS PYTHON Yandi Anzari; Ezrifal Sany; Lucy Simorangkir; Muh Subhan; Aulia Rachmawati; Suroto Suroto
Djtechno: Jurnal Teknologi Informasi Vol 6, No 3 (2025): Desember
Publisher : Universitas Dharmawangsa

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

Abstract

Dalam lanskap keamanan informasi modern, evaluasi terhadap ketahanan algoritma kriptografi klasik tetap memegang peranan vital sebagai landasan studi komputasi dan kriptanalisis. Penelitian ini menyajikan analisis forensik kuantitatif terhadap kinerja komputasi dan kerentanan keamanan algoritma Caesar Cipher menggunakan implementasi berbasis Python. Melalui pendekatan eksperimental terkendali, penelitian ini mengukur latensi enkripsi dan efektivitas serangan Brute Force pada dua skenario beban kerja: dataset teks pendek (118 karakter) dan dataset teks panjang (966 karakter). Hasil pengujian empiris menunjukkan bahwa algoritma ini memiliki efisiensi komputasi yang superior dengan waktu enkripsi rata-rata di bawah 1 milidetik. Namun, analisis statistik membuktikan adanya pemetaan frekuensi karakter yang bijektif (one-to-one mapping), yang menegaskan kegagalan algoritma dalam menerapkan prinsip pengaburan (confusion). Lebih lanjut, pengujian serangan Brute Force memvalidasi hipotesis linearitas kompleksitas waktu (O(N)), di mana peningkatan volume data sebesar 8,1 kali berkorelasi dengan peningkatan durasi serangan sebesar 9,6 kali. Dengan waktu pemecahan sandi rata-rata hanya 0,0127 detik untuk teks panjang, penelitian ini menyimpulkan bahwa Caesar Cipher memiliki margin keamanan yang dapat diabaikan (negligible) terhadap kapasitas komputasi modern, sehingga hanya relevan sebagai instrumen pedagogis dalam kurikulum keamanan siber.
Co-Authors -, Sailani A.A. Ketut Agung Cahyawan W Arfiensa, Dandy Aulia Rachmawati darex susanto, darex Djauhari, Teuku Fadhli, Muhamad Royhan Frayoga, Angga Gustina Halomoan Sihombing, Hanter Huda Aminuddin, Fattachul Ihwan Kurnia Baiturahman Kurniawan, Akhmad Yudiyanto Kurniawan, Yudiyanto Limia Budiarti, Rike Lucy Simorangkir M. Andy Saputra Merti Megawaty Mohdiaki, Amri Muh Subhan N, Muhammad Feraldi Nilawati Nilawati Novhirtamely Kahar Novhirtamely Kahar Novri Adhiatma, Novri Nur Wahid, Nur Rike Limia Budiarti, Rike Limia Siary, Wiwin Sigif Desrian Sri Mulyati Suroto suroto Suryawahyuni Latief Susi Susanti Yandi Anzari