Skip to main content
Journal ArticleOPEN ACCESS

Reversible cellular automata based encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3222 411-418
DOI: 10.1007/978-3-540-30141-7_58
27Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper cellular automata (CA) are applied to construct a symmetric-key encryption algorithm. A new block cipher based on one dimensional, uniform and reversible CA is proposed. A class of CA with rules specifically constructed to be reversible is used. The algorithm uses 224 bit key. It is shown that the algorithm satisfies safety criterion called Strict Avalanche Criterion. Due to a huge key space a brut-force attack appears practically impossible. © IFIP International Federation for Information Processing 2004.

Cite

CITATION STYLE

APA

Seredynski, M., Pienkosz, K., & Bouvry, P. (2004). Reversible cellular automata based encryption. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3222, 411–418. https://doi.org/10.1007/978-3-540-30141-7_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free