Key Scalability Effects on Entropy and Computational Complexity in a GA-SA Hybrid Cryptosystem

Authors

  • Naufal Muzakki Universitas Ahmad Dahlan, Indonesia
  • Nur Rochmah Dyah Puji Astuti Universitas Ahmad Dahlan, Indonesia
Pages Icon

DOI:

https://doi.org/10.63158/journalisi.v8i3.1607

Keywords:

Metaheuristic Hybridization, Pseudo-Random Keystream Generation, XOR Encryption, Genetic Algorithm, Simulated Annealing, Shannon Entropy, Key Scalability, Cryptographic Randomness

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.

Downloads

Download data is not yet available.

References

[1] L. B. Handoko and C. Umam, “A super encryption approach for enhancing digital security using column transposition-hill cipher for 3D image protection,” Kinet. Game Technol. Inf. Syst. Comput. Network, Comput. Electron. Control, Jun. 2024, doi: 10.22219/kinetik.v9i3.1984.

[2] S. Liang, Z. Dong, J. Peng, C. Jiang, and X. Zhao, “Research and implementation of secure dual algorithm-based transmission system for sensitive data of large models in an open environment,” IEEE Access, vol. 13, pp. 165247–165262, 2025, doi: 10.1109/ACCESS.2025.3605073.

[3] D. Jonas, I. Sembiring, A. Setiawan, D. Manongga, I. R. Widiasari, and D. Julianingsih, “XOR encryption based on index value enumeration used in IoT based healthcare,” in Proc. 11th Int. Conf. Cyber IT Service Manage. (CITSM), IEEE, Nov. 2023, pp. 1–5. doi: 10.1109/CITSM60085.2023.10455527.

[4] R. Reymond, J. Manullang, J. Tamba, F. P. Sitohang, and E. N. Ginting, “Cryptography with one-time pad (OTP) algorithm XOR based,” J. Tek. Indones., vol. 3, no. 02, pp. 54–60, Nov. 2024, doi: 10.58471/ju-ti.v3i02.664.

[5] R. B. Abduljabbar, O. K. Hamid, and N. J. Alhyani, “Features of genetic algorithm for plain text encryption,” Int. J. Electr. Comput. Eng., vol. 11, no. 1, pp. 434–441, Feb. 2021, doi: 10.11591/ijece.v11i1.pp434-441.

[6] S. S. Sultana, T. Tanabe, T. Fausten, and M. Irie, “Avoiding premature convergence to local optima with adaptive exploration for genetic algorithms,” in Proc. Genetic Evol. Comput. Conf. Companion (GECCO), ACM, Jul. 2025, pp. 539–542. doi: 10.1145/3712255.3726640.

[7] W. Yu, Y. Huang, Y. Yang, and A. Garcia-Ortiz, “Hybrid genetic algorithm combining simulated annealing for task allocation with data security,” in Proc. 19th Int. Conf. Distrib. Comput. Smart Syst. Internet Things (DCOSS-IoT), IEEE, Jun. 2023, pp. 134–141. doi: 10.1109/DCOSS-IoT58021.2023.00033.

[8] T. Zhang, B. Zhu, Y. Ma, and X. Zhou, “A novel image encryption algorithm based on multiple random DNA coding and annealing,” Electronics, vol. 12, no. 3, p. 501, Jan. 2023, doi: 10.3390/electronics12030501.

[9] M. K. Nayak and P. K. Swain, “Color image encryption using lightweight cryptography and genetic algorithm for secure internet of things,” SSRG Int. J. Electr. Electron. Eng., vol. 11, no. 7, pp. 271–279, Jul. 2024, doi: 10.14445/23488379/IJEEE-V11I7P124.

[10] G. Singla and G. Kaur, “New enhanced hybrid cryptographic algorithms in cloud network,” in Proc. 1st Int. Conf. Adv. Electr. Electron. Comput. Intell. (ICAEECI), IEEE, Oct. 2023, pp. 1–6. doi: 10.1109/ICAEECI58247.2023.10370940.

[11] J. S. Yalli et al., “A systematic review for evaluating IoT security: A focus on authentication, protocols and enabling technologies,” IEEE Internet Things J., vol. 12, no. 12, pp. 18908–18928, Jun. 2025, doi: 10.1109/JIOT.2025.3545737.

[12] H. Saini, G. Singh, and M. Rohil, “Design of hybrid metaheuristic optimization algorithm for trust-aware privacy preservation in cloud computing,” Int. J. Comput. Netw. Appl., vol. 10, no. 6, pp. 934–946, Dec. 2023, doi: 10.22247/ijcna/2023/223690.

[13] P. Mukherjee, H. Garg, C. Pradhan, S. Ghosh, S. Chowdhury, and G. Srivastava, “Best fit DNA-based cryptographic keys: The genetic algorithm approach,” Sensors, vol. 22, no. 19, p. 7332, Sep. 2022, doi: 10.3390/s22197332.

[14] A. Almomani, K. Mhaidat, O. Al-Khaleel, and M. Al-Khaleel, “An efficient and scalable Montgomery modular multiplier for cryptographic applications,” IEEE Open J. Comput. Soc., vol. 6, pp. 1822–1833, 2025, doi: 10.1109/OJCS.2025.3628878.

[15] P. Bagane and S. Kotrappa, “Enriching AES through the key generation from genetic algorithm,” Indian J. Comput. Sci. Eng., vol. 12, no. 4, pp. 955–963, Aug. 2021, doi: 10.21817/indjcse/2021/v12i4/211204141.

[16] R. A. A. Qasim and B. S. Mahdi, “Image protection using genetic algorithm and cipher technique,” Iraqi J. Comput. Commun. Control Syst. Eng., vol. 22, no. 4, pp. 160–166, 2022, doi: 10.33103/uot.ijccce.22.4.13.

[17] M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA, USA: MIT Press, 1996. doi: 10.7551/mitpress/3927.001.0001.

[18] R. Martín-Santamaría, S. Cavero, A. Herrán, A. Duarte, and J. M. Colmenar, “A practical methodology for reproducible experimentation: An application to the double-row facility layout problem,” Evol. Comput., vol. 32, no. 1, pp. 69–104, Mar. 2024, doi: 10.1162/evco_a_00317.

[19] A. Abid, M. Jarjar, M. Kattass, H. Rrghout, A. Jarjar, and A. Benazzi, “Genetic algorithm using Feistel and genetic operator acting at the bit level for images encryption,” Int. J. Saf. Secur. Eng., vol. 14, no. 1, pp. 15–27, Feb. 2024, doi: 10.18280/ijsse.140102.

[20] S. Rimcharoen and N. Leelathakul, “Ring-based crossovers in genetic algorithms: Characteristic decomposition and their generalization,” IEEE Access, vol. 9, pp. 137902–137922, 2021, doi: 10.1109/ACCESS.2021.3117987.

[21] P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, “Genetic algorithms for the travelling salesman problem: A review of representations and operators,” Artif. Intell. Rev., vol. 13, no. 2, pp. 129–170, Apr. 1999, doi: 10.1023/A:1006529012972.

[22] S. Kumar and D. Sharma, “Key generation in cryptography using elliptic-curve cryptography and genetic algorithm,” in Eng. Proc., MDPI, Dec. 2023, p. 59. doi: 10.3390/engproc2023059059.

[23] O. Tito-Corrioso, M. Borges-Quintana, M. A. Borges-Trenard, O. Rojas, and G. Sosa-Gómez, “On the fitness functions involved in genetic algorithms and the cryptanalysis of block ciphers,” Entropy, vol. 25, no. 2, p. 261, Jan. 2023, doi: 10.3390/e25020261.

[24] A. Hemmak, “Optimal adjusting of simulated annealing parameters,” Mil. Tech. Cour., vol. 72, no. 1, pp. 80–93, 2024, doi: 10.5937/vojtehg72-47242.

[25] D. Henderson, S. H. Jacobson, and A. W. Johnson, “The theory and practice of simulated annealing,” in Handbook of Metaheuristics, Boston, MA, USA: Kluwer Academic Publishers, 2006, pp. 287–319. doi: 10.1007/0-306-48056-5_10.

[26] A. Kuznetsov et al., “Generation of nonlinear substitutions by simulated annealing algorithm,” Information, vol. 14, no. 5, p. 259, Apr. 2023, doi: 10.3390/info14050259.

[27] C. Pokhrel, R. Ghimire, B. R. Dawadi, and P. Manzoni, “A machine learning-based hybrid encryption approach for securing messages in software-defined networking,” Network, vol. 5, no. 1, p. 8, Mar. 2025, doi: 10.3390/network5010008.

[28] M. Borges-Quintana, M. A. Borges-Trenard, O. Tito-Corrioso, O. Rojas, and G. Sosa-Gómez, “Combined and general methodologies of key space partition for the cryptanalysis of block ciphers,” Cryptography, vol. 8, no. 4, p. 45, Oct. 2024, doi: 10.3390/cryptography8040045.

[29] D. Ramakrishna and M. Ali Shaik, “A comprehensive analysis of cryptographic algorithms: Evaluating security, efficiency, and future challenges,” IEEE Access, vol. 13, pp. 11576–11593, 2025, doi: 10.1109/ACCESS.2024.3518533.

[30] M. D. Asrofa, S. Bahri, and K. Kasliono, “One-time pad cryptography for secure data transmission in IoT smart door using QR code,” J. Media Inf. Teknol., vol. 2, no. 2, pp. 133–148, Oct. 2025, doi: 10.69616/mit.v2i2.248.

[31] H. M. Bahig, M. A. G. Hazber, and H. M. Bahig, “An efficient simulated annealing algorithm for short addition sequences,” AIMS Math., vol. 9, no. 5, pp. 11024–11038, 2024, doi: 10.3934/math.2024540.

[32] D. E. Goldberg, Genetic algorithms in search, optimization, and machine learning, Boston, MA, USA: Addison-Wesley, 1989. doi: 10.5860/choice.27-0936.

[33] C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, no. 3, pp. 379–423, Jul. 1948, doi: 10.1002/j.1538-7305.1948.tb01338.x.

[34] A. Rukhin, J. Soto, and J. Nechvatal, “A statistical test suite for random and pseudorandom number generators for cryptographic applications,” Nat. Inst. Stand. Technol., Gaithersburg, MD, USA, NIST SP 800-22 Rev. 1a, 2010. doi: 10.6028/NIST.SP.800-22r1a.

[35] G. S. Shyaa and M. Al-Zubaidie, “Utilizing trusted lightweight ciphers to support electronic-commerce transaction cryptography,” Appl. Sci., vol. 13, no. 12, p. 7085, Jun. 2023, doi: 10.3390/app13127085.

Downloads

Published

2026-06-22

Issue

Vol. 8 No. 3 (2026): June

Section

Articles

License

Copyright (c) 2026 Journal of Information Systems and Informatics

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors Declaration

  1. The Authors certify that they have read, understood, and agreed to the Journal of Information Systems and Informatics (JournalISI) submission guidelines, policies, and submission declaration. The submission has been prepared using the provided template.
  2. The Authors certify that all authors have approved the publication of this manuscript and that there is no conflict of interest.
  3. The Authors confirm that the manuscript is their original work, has not received prior publication, is not under consideration for publication elsewhere, and has not been previously published.
  4. The Authors confirm that all authors listed on the title page have contributed significantly to the work, have read the manuscript, attest to the validity and legitimacy of the data and its interpretation, and agree to its submission.
  5. The Authors confirm that the manuscript is not copied from or plagiarized from any other published work.
  6. The Authors declare that the manuscript will not be submitted for publication in any other journal or magazine until a decision is made by the journal editors.
  7. If the manuscript is finally accepted for publication, the Authors confirm that they will either proceed with publication immediately or withdraw the manuscript in accordance with the journal’s withdrawal policies.
  8. The Authors agree that, upon publication of the manuscript in this journal, they transfer copyright or assign exclusive rights to the publisher, including commercial rights