Enhancing the randomness of a symmetric cryptographic technique based on linear 1-D cellular automata
A. Yasmin, Ramarathnam Venkatesan, K. Gaverchand · Journal of Discrete Mathematical Sciences and Cryptography · 2025
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.