Encryption Algorithm for Block Ciphers Based on Programmable Cellular Automata
26 Mar 2010-pp 269-275
TL;DR: The Cellular Automata in cryptography for a class of Block Ciphers through a new block encryption algorithm based on programmable cellular automata belongs to the class of symmetric key systems.
Abstract: A Cellular Automata (CA) is a computing model of complex System using simple rule. In this paper the problem space is divided into number of cell and each cell can be one or several final state. Cells are affected by neighbor’s with the application of simple rule. This paper deals with the Cellular Automata in cryptography for a class of Block Ciphers through a new block encryption algorithm based on programmable cellular automata.The proposed algorithm belongs to the class of symmetric key systems.
Citations
More filters
TL;DR: Security analysis and experimental results show that the proposed method has a very large key space and is resistive against noise and attacks and the amount of entropy is equal to 7.9991 which is very close to 8 which is ideal.
269 citations
SIDI1
TL;DR: Results of various experiments and analysis show that high security and execution performances can be achieved using the proposed approach, and furthermore, it provides the ability to perform a selective area decryption since any part of the ciphered-image can be deciphered independently from others, which is very useful for real time applications.
64 citations
SIDI1
TL;DR: A new tweakable construction of block-enciphers using second-order reversible cellular automata that defines a flexible pseudorandom permutation that can be used with efficacy to solve the electronic code book problem without the need to a specific sequential mode is proposed.
Abstract: We propose a new tweakable construction of block-enciphers using second-order reversible cellular automata, and we apply it to encipher RGB-colored images. The proposed construction permits a parallel encryption of the image content by extending the standard definition of a block cipher to take into account a supplementary parameter used as a tweak (nonce) to control the behavior of the cipher from one region of the image to the other, and hence avoid the necessity to use slow sequential encryption׳s operating modes. The proposed construction defines a flexible pseudorandom permutation that can be used with efficacy to solve the electronic code book problem without the need to a specific sequential mode. Obtained results from various experiments show that the proposed schema achieves high security and execution performances, and enables an interesting mode of selective area decryption due to the parallel character of the approach.
30 citations
30 Mar 2011
TL;DR: This paper aims to describe and review the different research that has done toward text encryption and description in the block cipher, and suggests a cryptography model inThe block cipher.
Abstract: The complexity of cryptography does not allow many people to actually understand the motivations and therefore available for practicing security cryptography. Cryptography process seeks to distribute an estimation of basic cryptographic primitives across a number of confluences in order to reduce security assumptions on individual nodes, which establish a level of fault-tolerance opposing to the node alteration. In a progressively networked and distributed communications environment, there are more and more useful situations where the ability to distribute a computation between a number of unlike network intersections is needed. The reason back to the efficiency (separate nodes perform distinct tasks), fault-tolerance (if some nodes are unavailable then others can perform the task) and security (the trust required to perform the task is shared between nodes) that order differently. Hence, this paper aims to describe and review the different research that has done toward text encryption and description in the block cipher. Moreover, this paper suggests a cryptography model in the block cipher.
26 citations
Cites background from "Encryption Algorithm for Block Ciph..."
...The proposed algorithm belongs to the class of symmetric key systems [17]....
[...]
TL;DR: Experimental results show that this PCCA by using Sandpile model is able to reach a random behavior from a pseudo-chaotic one by combining two self-organized systems, and it has been indicated that the generated numbers are independent and its probability distribution is likely to be uniform.
13 citations
Cites background from "Encryption Algorithm for Block Ciph..."
...Also, extensive studies have been done on PCA for generating random numbers [1–3,19,20,23,34]....
[...]
References
More filters
18 Aug 1985
TL;DR: This abstract discusses a stream cipher based on a simple one-dimensional cellular automaton that can be obtained from binary plaintext P as usual according to Ci = Pi XOR a(i); the plaintext can be recovered by repeating the same operation, but only if the sequence a( i) is known.
Abstract: This abstract discusses a stream cipher based on a simple one-dimensional cellular automaton. The cellular automaton consists of a circular register with N cells, each having value ai equal to 0 or 1. The values are updated synchronously in discrete time steps according to the rule ai? = ai-1 XOR (ai OR ai+1), (1a) or, equivalently, ai? = (ai-1 + ai + ai+1 + aiai+1) mod 2. (1b) The initial state of the register is used as a seed or key. The values a(i) attained by a particular cell through time can then serve as a random sequence. Ciphertext C can be obtained from binary plaintext P as usual according to Ci = Pi XOR a(i); the plaintext can be recovered by repeating the same operation, but only if the sequence a(i) is known.
382 citations
Journal Article•
103 citations
"Encryption Algorithm for Block Ciph..." refers methods in this paper
...CA based public cipher was proposed by Guan [7]....
[...]
TL;DR: This work proposes a new encryption algorithm relying on reversible cellular automata (CA), which belongs to the class of symmetric key systems and makes them interesting candidates for cryptography.
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.
44 citations