Abstract
In this paper, we expand upon Cipher Block Chaining (CBC), and explore large cycle reversible non-uniform cellular automata for secure encryption and decryption. Both our encryption and decryption algorithms have an O(n) time complexity. We have conducted statistical tests like NIST, dieharder, and smallCrush to prove its robustness, along with brute force attacks and strict avalanche criterion (SAC) to further test its security. Analysis for known plaintext attack and chosen plaintext attack shows that neither of the attacks are feasible. Lastly, a visual test is conducted to further show the aparant randomness of the ciphertexts.
T. Lywait, K. Srinivasan and K. Nair—These authors contributed equally to this work.
This work is partially supported by Start-up Research Grant (File number: SRG/2022/002098), SERB, Department of Science & Technology, Government of India.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-39799-X_32
Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata: Theory and Applications, Volume 1 (Vol. 43). Wiley, Hoboken (1997)
Nandi, S., Kar, B., Pal, P.: Theory and applications of cellular automata. IEEE Trans. Comput. 43(1346), 1357 (1995). https://doi.org/10.1109/12.338094
Tomassini, M., Perrenoud, M.: Cryptography with cellular automata. Appl. Soft Comput. 1(2), 151–160 (2001)
Banerjee, T., Roy Chowdhury, D. (2021). EnCash: an authenticated encryption scheme using cellular automata. In: Gwizdałła, T.M., Manzoni, L., Sirakoulis, G.C., Bandini, S., Podlaski, K. (eds.) ACRI 2020. LNCS, vol. 12599, pp. 67–79. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-69480-7_8
Mukhopadhyay, D., RoyChowdhury, D.: Cellular automata: an ideal candidate for a block cipher. In: Ghosh, R.K., Mohanty, H. (eds.) ICDCIT 2004. LNCS, vol. 3347, pp. 452–457. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30555-2_52
Das, S., RoyChowdhury, D.: CAR30: a new scalable stream cipher with rule 30. Cryptogr. Commun. 5, 137–162 (2013)
Mukherjee, S., Adak, S., Bhattacharjee, K., Das, S.: Non-uniform non-linear cellular automata with large cycles and their application in pseudo-random number generation. Int. J. Mod. Phys. C 32 (2021). https://doi.org/10.1142/S0129183121500911.
Mariot, L., Leporati, A.: A cryptographic and coding-theoretic perspective on the global rules of cellular automata. Nat. Comput. 17, 487–498 (2018)
Lira, E.R., de Macêdo, H.B., Lima, D.A., Alt, L., Oliveira, G.M.: A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher. Nat. Comput. 1–17 (2023)
Brown, R.G., Eddelbuettel, D., Bauer, D.: Dieharder: A Random Number Test Suite. https://webhome.phy.duke.edu/~rgb/General/ dieharder.php
Rukhin, A., et al.: Statistical test suite for random and pseudorandom number generators for cryptographic applications, NIST special publication. revision 1a, volume 800-22. National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (2010)
Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3–30 (1998). https://doi.org/10.1145/272991.272995
L’Ecuyer, P., Simard, R.: TestU01: a C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22:1–22:40 (2007)
https://github.com/ghadilion/large-cycle-rca-symmetric-key-cryptosystem/tree/main
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Lywait, T., Srinivasan, K., Nair, K., Bhattacharjee, K. (2024). A Scheme for Symmetric Cryptosystem Using Large Cycle Reversible Cellular Automata. In: Bagnoli, F., Baetens, J., Bandini, S., Matteuzzi, T. (eds) Cellular Automata. ACRI 2024. Lecture Notes in Computer Science, vol 14978. Springer, Cham. https://doi.org/10.1007/978-3-031-71552-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-71552-5_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-71551-8
Online ISBN: 978-3-031-71552-5
eBook Packages: Computer ScienceComputer Science (R0)