Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Sistemasi: Jurnal Sistem Informasi Journal of Information Systems and Informatics
Naufal Muzakki
Universitas Ahmad Dahlan
Computer Science & IT Electrical & Electronics Engineering

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

Found 2 Documents
Search

 1 
Optimization of XOR Cryptographic Keys using a Hybrid Genetic Algorithm and Simulated Annealing Naufal Muzakki; Nur Rochmah Dyah Puji Astuti
Sistemasi: Jurnal Sistem Informasi Vol 15, No 3 (2026): Sistemasi: Jurnal Sistem Informasi
Publisher : Program Studi Sistem Informasi Fakultas Teknik dan Ilmu Komputer

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32520/stmsi.v15i3.6170

Abstract

The security level of basic encryption algorithms, such as XOR, is highly dependent on the randomness and bit distribution pattern of the applied key. The use of stochastic optimization approaches, such as Genetic Algorithm (GA), in key generation often faces challenges due to premature convergence, a condition in which the search halts at a local optimum before achieving maximal entropy. This study proposes a sequential hybrid algorithm strategy that combines GA with Simulated Annealing (SA) to address fitness stagnation in PDF document encryption. The strategy is implemented through a two-phase mechanism: GA performs global exploration to identify potential solution regions, followed by SA performing local exploitation with a perturbation mechanism guided by the Metropolis probability. The algorithm’s performance is evaluated through a comparative study between conventional GA and the hybrid GA-SA. Experimental results indicate that the hybrid strategy successfully increases the average fitness value by 4.86%, achieves a Shannon entropy of 7.8952, and attains an NIST test P-value of 0.5299. These improvements demonstrate that the integration of SA effectively enhances the final solution quality of GA, producing cryptographic keys with more uniform bit distribution, passing statistical randomness tests, and exhibiting robustness against pattern analysis.
Key Scalability Effects on Entropy and Computational Complexity in a GA-SA Hybrid Cryptosystem Naufal Muzakki; Nur Rochmah Dyah Puji Astuti
Journal of Information System and Informatics Vol 8 No 3 (2026): June
Publisher : Asosiasi Doktor Sistem Informasi Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.63158/journalisi.v8i3.1607

Abstract

Digital data security demands robust encryption systems in which key randomness quality serves as the primary determining factor. Metaheuristic algorithms such as the Genetic Algorithm (GA) and Simulated Annealing (SA) exhibit significant potential for key generation optimization. However, each is individually susceptible to premature convergence and slow computational time, respectively, motivating their sequential hybridization. This study proposes a GA-SA hybrid cryptographic architecture with dynamic population sizing to optimize pseudo-random keystream generation in XOR encryption, evaluated using 15 PDF document datasets across three key configurations: 16 characters (128-bit), 32 characters (256-bit), and 64 characters (512-bit). The hybrid system consistently reduced local optima entrapment across all configurations, with the 64-character key achieving the highest randomness quality at a Shannon Entropy of 7.9288 bits/byte and a mean NIST SP 800-22 Monobit Frequency Test P-Value of 0.2999, though this does not constitute a full NIST SP 800-22 suite evaluation. Runtime analysis showed near-linear empirical growth within the tested range, from 0.0361 seconds to 0.1305 seconds, without exponential bottleneck effects, suggesting the proposed architecture is a promising candidate for pseudo-random keystream generation under tested conditions, with further validation recommended before production deployment.
Co-Authors Nur Rochmah Dyah Pujiastuti