Skip to main content

Advertisement

Springer Nature Link
Log in

Block cipher based on reversible cellular automata

  • Special Issue
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

We propose a new encryption algorithm relying on reversible cellular automata (CA). The behavior complexity of CA and their parallel nature makes them interesting candidates for cryptography. The proposed algorithm belongs to the class of symmetric key systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Menezes, A., van Oorschot, P. and Vanstone, S.,Handbook of Applied Cryptography, CRC Press, 1996.

  2. Stallings, W.,Cryptography and Network Security (Third Edition), Prentice Hall, 2003.

  3. Guan, P., “Cellular Automaton Public-Key Cryptosystem,”Complex Systems 1 pp. 51–56, 1987.

    MATH  MathSciNet  Google Scholar 

  4. Seredynski, F., Bouvry, P. and Zomaya, A.Y., “Cellular Programming and Symmetric Key Cryptography Systems,” inProc. of the Genetic and Evolutionary Computation — GECCO 2003 (E. Cantú-Paz et al. eds.),LNCS 2724, pp. 1369–1381, Springer-Verlag, 2003.

  5. Toffoli, T. and Margolus, N., “Invertible Cellular Automata: A Review,”Physica, Vol. D 45, pp. 229–253, 1990.

    MATH  MathSciNet  Google Scholar 

  6. Tomassini, M. and Perrenoud, M., “Stream Ciphers with One and Two-Dimensional Cellular Automata,” inProc. of the Parallel Problem Solving from Nature — PPSN VI (M. Schoenauer at al. eds.),LNCS, 1917, pp. 722–731, Springer-Verlag, 2000.

  7. Wolfram, S.,A New Kind of Science, Wolfram Media, 2002.

  8. Wolfram, S., “Cryptography with Cellular Automata,” inProc. of the Advances in Cryptology: Crypto ’85 (H.C. Williams ed.),LNCS, 218, pp. 429–432, Springer-Verlag, 1985.

  9. Gutowitz, H.A., “Cryptography with Dynamical Systems,” inCellular Automata and Cooperative Phenomena (E. Goles at al. eds.), Kluwer Academic Press, 1993.

  10. Feistel, H., “Cryptography and Computer Privacy,”Scientific American, 228, 5, pp. 15–23, 1973.

    Article  Google Scholar 

  11. Kam, J. and Davida, G., “Structured Design of Substitution-Permutation Encryption Networks,”IEEE Transactions on Computers, C-28, 10, pp. 747–753, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  12. Webster, A.F. and Tavares, S.E., “On the Design of S-Boxes,” inProc. of the Advances in Cryptology: Crypto ’85 (H.C. Williams ed.),LNCS, 218, pp. 523–534, Springer-Verlag, 1985.

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Technology and Communication, University of Luxembourg, 6, rue Coudenhove Kalergi, L-1359, Luxembourg-Kirchberg, Luxembourg

    Marcin Seredynski & Pascal Bouvry

Authors
  1. Marcin Seredynski
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Pascal Bouvry
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Marcin Seredynski.

Additional information

Marcin Seredynski: He is a Ph.D. student at University of Luxembourg and Polish Academy of Sciences. He received his M.S. in 2004 from Faculty of Electronics and Information Technology in Warsaw University of Technology. His research interests include cryptography, cellular automata, nature inspired algorithms and network security. Currently he is working on intrusion detection algorithms for ad-hoc networks.

Pascal Bouvry, Ph.D.: He earned his undergraduate degree in Economical & Social Sciences and his Master degree in Computer Science with distinction (’91) from the University of Namur, Belgium. He went on to obtain his Ph.D. degree (’94) in Computer Science with great distinction at the University of Grenoble (INPG), France. His research at the IMAG laboratory focussed on Mapping and scheduling task graphs onto Distributed Memory Parallel Computers. Next, he performed post-doctoral researches on coordination languages and multi-agent evolutionary computing at CWI in Amsterdam. He gained industrial experience as manager of the technology consultant team for FICS in the banking sector (Brussels, Belgium). Next, he worked as CEO and CTO of SDC (Ho Chi Minh city, Vietnam) in the telecom, semi-conductor and space industry. After that, He moved to Montreal Canada as VP Production of Lat45 and Development Director for MetaSolv Software in the telecom industry. He is currently serving as Professor in the group of Computer Science and Communications (CSC) of the Faculty of Sciences, Technology and Communications of Luxembourg University and he is heading the Intelligent & Adaptive Systems lab. His current research interests include: ad-hoc networks & grid-computing, evolutionary algorithms and multi-agent systems.

About this article

Cite this article

Seredynski, M., Bouvry, P. Block cipher based on reversible cellular automata. New Gener Comput 23, 245–258 (2005). https://doi.org/10.1007/BF03037658

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037658

Keywords