Abstract
Reverse algorithm was previously evaluated as encryption method concluding that its simple adoption is unviable, since it does not assurance the pre-image existence. Variable-Length Encryption Method (VLE) was proposed where a alternative algorithm with extra bits is adopted when pre-image computation is not possible. If an adequate secret key is used with VLE it is expected that the final ciphertext length is close to plaintext size. Several CA static parameters were calculated for a set formed by all radius 2 right-toggle rules. A database was generated associating rules performance in VLE ciphering with its parameters. A genetic algorithm-based data mining was performed to discover an adequate key specification based on CA parameters. Using such specification, ciphertext length is short, encryption process returns high entropy and VLE has a good protection against differential cryptanalysis.
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
Preview
Unable to display preview. Download preview PDF.
References
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)
Tomassini, M., Perrenoud, M.: Stream Ciphers with One and Two-Dimensional Cellular Automata. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 722–731. Springer, Heidelberg (2000)
Seredynski, F., Bouvry, P., Zomaya, A.Y.: Secret key cryptography with cellular automata. In: Workshop on Nature Inspired Distributed Computing (2003)
Benkiniouar, M., Benmohamed, M.:: Cellular Automata for Cryptosystem. In: Proceedings of IEEE Conference Information and Communication Technologies: From Theory to Applications, pp. 423-424 (2004)
Kari, J.: Cryptosystem based on reversible cellular automata. Personal communication. Apud in (Seredynski, Bouvry and Zomaya, 2003) (1994)
Nandi, S., Kar, B., Chaudhuri, P.: Theory and Applications of CA Automata in Cryptography. IEEE Transactions on Computers 43, 1346–1357 (1994)
Gutowitz, H.: Cryptography with Dynamical Systems. In: Goles, E., Boccara, N. (eds.) Cellular Automata and Cooperative Phenomena, vol. 1, pp. 237–274. Kluwer Acapdemic Press, Dordrecht (1995)
Oliveira, G., Coelho, A., e Monteiro, L.: Cellular Automata Cryptographic Model Based on Bi-Directional Toggle Rules. I. J. Modern Physics C 15, 1061–1068 (2004)
Oliveira, G., Macêdo, H., Branquinho, A., Lima, M.: A cryptographic model based on the pre-image computation of cellular automata. In: Automata-2008: Theory and Applications of Cellular Automata, pp. 139–155. Luniver Press (2008)
Oliveira, G.M.B., Martins, L.G.A., Alt, L.S., Ferreira, G.B.: Exhaustive Evaluation of Radius 2 Toggle Rules for a Variable-Length Cryptographic CA-Based Model. In: Int. Conf. on Cellular Automata for Research and Industry, Ascoli Piceno (2010)
Oliveira, G.M.B., Martins, L.G.A., Alt, L.S., Ferreira, G.B.:: Investigating a Cellular Automata-Based Cryptographic Model with a Variable-Length Ciphertext. In: CSC 2010, - International Conference on Scientific Computing, Las Vegas (2010)
Wuensche, A., Lesser, M.: Global Dynamics of Cellular Automata. Addison-Wesley, New Mexico (1992) ISBN: 0-201-55740-1
Fidelis, M., Lopes, H., Freitas, A.: Discovery comprehensible classification rules with a genetic algorithm. In: C.Evolutionary Computation, CEC 2000, USA (2000)
Oliveira, G., de Oliveira, P., e Omar, N.: Definition and applications of a five-parameter characterization of 1D cellular automata rule space. Artificial Life 7(3), 277–301 (2001)
Sen, S., Shaw, C., Chowdhuri, D., Ganguly, N., Chaudhuri, P.: Cellular Automata based Cryptosystem (CAC). In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 303–314. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, G.M.B., Martins, L.G.A., Ferreira, G.B., Alt, L.S. (2010). Secret Key Specification for a Variable-Length Cryptographic Cellular Automata Model. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-15871-1_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15870-4
Online ISBN: 978-3-642-15871-1
eBook Packages: Computer ScienceComputer Science (R0)