TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Enhancing the randomness of a symmetric cryptographic technique based on linear 1-D cellular automata

, * ,

* Corresponding author · click or hover a name for details

pp. 185–204Vol. 28Issue 1February 2025DOI: 10.47974/JDMSC-2133 Crossmark XML
Received:
06 Dec 2023
Published Online:
28 Feb 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2133
Pages:
185–204

Abstract

In today’s digital age, concerns over data privacy and the escalating threat of cyber attacks underscore the necessity for an innovative cryptographic algorithms to safeguard textual data. This paper proposes an innovative symmetric key cryptographic technique that integrates cellular automata (CA) due to their high non-linearity, randomness and complexity, enhancing resistance to attacks. A class of linear CA rules 90 and 150 is used to generate the 256-bit secret key. This proposed model has undergone various analysis and randomness test such as comparative analysis, complexity analysis and different NIST test in order to affirm its efficiency and suitability for data encryption. Software implementations have been conducted using Python, emphasizing real-world applicability for text security in a dynamic digital environment. Finally, the overall results affirm that the proposed cryptographic model as a secure and highly efficient solution for a variety of practical applications where text encryption and randomness is critical. 

Keywords

Subject Classifications

94A6068Q8068P25

References

[1] S. Acharjee, R. Ray, S. Chakraborty, S. Nath, and N. Dey, “Watermarking in motion vector for security enhancement of medical videos,” in Proc. 2014 Int. Conf. Control, Instrumentation, Communication and Computational Technologies (ICCICCT), pp. 532–537 (2014), doi: 10.1109/ICCICCT.2014.6993019.
[2] K. Achkoun, C. Hanin, and F. Omary, “SPF-CA: A new cellular auomata based block cipher using key-dependent S-boxes,” J. Discrete Math. Sci. Cryptogr., vol. 23, no. 8, pp. 1529–1544 (2020), doi: 10.1080/09720529.2019.1649031.
[3] P. Anghelescu, S. Ionita, and E. Sofron, “FPGA implementation of hybrid additive programmable cellular automata encryption algorithm,” in Proc. 2008 Eighth Int. Conf. Hybrid Intelligent Systems, pp. 96–101 (2008), doi: 10.1109/HIS.2008.24.
[4] K. V. Angulo, D. G. Gil, and H. E. Espitia, “Modeling and numerical validation for an algorithm based on cellular automata to reduce noise in digital images,” Computers, vol. 11, no. 3, p. 46 (2022), doi: 10.3390/computers11030046.
[5] A. Boudali, N. H. Said, and A. Ali-Pacha, “A new symmetrical cryptosystem based on cellular automata and chaotic map function,” J. Discrete Math. Sci. Cryptogr., vol. 25, no. 5, pp. 1435–1455 (2022), doi: 10.1080/09720529.2021.2020427.
[6] M. Devipriya, M. Sreenivasan, and M. Brindha, “Reconfigurable architecture for image encryption using a three-layer artificial neural network,” IETE J. Res., pp. 1–14 (2022), doi: 10.1080/03772063.2022.2127940.
[7] N. Dey, B. Nandi, M. Dey, D. Biswas, A. Das, and S. S. Chaudhuri, “BioHash code generation from electrocardiogram features,” in Proc. 2013 3rd IEEE Int. Adv. Computing Conf. (IACC), pp. 732–735 (2013), doi: 10.1109/IAdCC.2013.6514317.
[8] G. Kaverchand and R. Venkatesan, “A novel approach of 1-D cellular automata in cryptosystem,” Math. Model. Eng. Problems, vol. 10, no. 9, pp. 2121–2126 (2023), doi: 10.18280/mmep.100623.
[9] G. Kumaresan and N. P. Gopalan, “An analytical study of cellular automata and its applications in cryptography,” Int. J. Comput. Network Inf. Secur., vol. 10, no. 12, p. 45 (2017), doi: 10.5815/ijcnis.2017.12.06.
[10] R. Kuppan, L. Shobana, and I. N. Cangul, “Encrypting and decrypting algorithms using strong face graph of a tree,” Int. J. Comput. Math.: Comput. Syst. Theory, vol. 5, no. 4, pp. 225–233 (2020), doi: 10.1080/23799927.2020.1807606.
[11] X.-W. Li, S.-T. Kim, and Q.-H. Wang, “Designing three-dimensional cellular automata based video authentication with an optical integral imaging generated memory-distributed watermark,” IEEE J. Sel. Topics Signal Process., vol. 11, no. 7, pp. 1200–1212 (2017), doi: 10.1109/JSTSP.2017.2714838.
[12] S. K. Nanda, S. Mohanty, P. K. Pattnaik, and M. Sain, “Throughput optimized reversible cellular automata based security algorithm,” Electronics, vol. 11, no. 19, p. 3190 (2022), doi: 10.3390/electronics11193190.
[13] J. von Neumann, Theory of Self-Reproducing Automata, A. W. Burks, Ed. (1966).
[14] D. Parashar, S. Roy, N. Dey, V. Jain, and U. S. Rawat, “Symmetric key encryption technique: A cellular automata based approach,” in Cyber Security: Proc. CSI 2015, pp. 59–67 (2018), doi: 10.1007/978-981-10-8536-9_7.
[15] S. A. Perestrelo, M. C. Grácio, N. de A. Ribeiro, and L. M. Lopes, “A multi-scale network with percolation model to describe the spreading of forest fires,” Mathematics, vol. 10, no. 4, p. 588 (2022), doi: 10.3390/math10040588.
[16] K. Rao and S. Mandapati, “A novel image encryption using parity based visual cryptography,” Ingénierie Des Systèmes d’Information, vol. 26, no. 9, pp. 135–142 (2021), doi: 10.18280/isi.260115.
[17] M. Sipper, Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer (1997).
[18] W. Wang, Y. Zhou, J. Liu, and B. Sun, “On-street cruising for parking model in consideration with gaming elements and its impact analysis,” Mathematics, vol. 10, no. 19, p. 3423, 2022, doi: 10.3390/math10193423.

Views: 201Downloads: 62Citations: 1