A Parallel AES Encryption Algorithm Based on PCA
23 Sep 2011-Communications in computer and information science (Springer, Berlin, Heidelberg)-pp 238-246
TL;DR: This paper deals with the cryptography for a parallel AES encryption algorithm based on programmable cellular automata based on symmetric key systems for solving task density and synchronization problems.
Abstract: Programmable Cellular Automata (PCA) employs some control signals on a Cellular Automata(CA) structure. Programmable Cellular Automata were successfully applied for simulation of biological systems, physical systems and recently to design parallel and distributed algorithms for solving task density and synchronization problems. In this paper PCA is applied to develop cryptography algorithms. This paper deals with the cryptography for a parallel AES encryption algorithm based on programmable cellular automata. This proposed algorithm based on symmetric key systems.
References
More filters
Book•
01 Jan 2001
TL;DR: Simplified variants that omit a quadratic function and a fixed rotation in RC6 are examined to clarify their essential contribution to the overall security of RC6.
Abstract: RC6 has been submitted as a candidate for the Advanced Encryption Standard (AES). Two important features of RC6 that were absent from its predecessor RC5 are a quadratic function and a fixed rotation. By examining simplified variants that omit these features we clarify their essential contribution to the overall security of RC6.
1,487 citations
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
01 May 2004
TL;DR: In this paper, cellular automata (CAs) are used to design a symmetric key cryptography system based on Vernam cipher which provides very high quality encryption, and the system is very resistant to attempts of breaking the cryptography key.
Abstract: In this paper, cellular automata (CAs) are used to design a symmetric key cryptography system based on Vernam cipher. CAs are applied to generate a pseudo-random numbers sequence (PNS) which is used during the encryption process. The quality of PNSs highly depends on the set of applied CA rules. Rules of radius r = 1 and 2 for nonuniform one-dimensional CAs have been considered. A new set of rules has been discovered using an evolutionary technique called cellular programming. This set provides very high quality encryption, and the system is very resistant to attempts of breaking the cryptography key.
145 citations
Additional excerpts
...al[6]....
[...]
05 Feb 2004
TL;DR: The resulting design offers better hardware efficiency than other recent 128-key-bit block ciphers and Resistance against side-channel cryptanalysis was also considered as a design criteria for ICEBERG.
Abstract: We present a fast involutional block cipher optimized for reconfigurable hardware implementations. ICEBERG uses 64-bit text blocks and 128-bit keys. All components are involutional and allow very efficient combinations of encryption/decryption. Hardware implementations of ICEBERG allow to change the key at every clock cycle without any performance loss and its round keys are derived “on-the-fly” in encryption and decryption modes (no storage of round keys is needed). The resulting design offers better hardware efficiency than other recent 128-key-bit block ciphers. Resistance against side-channel cryptanalysis was also considered as a design criteria for ICEBERG.
110 citations
"A Parallel AES Encryption Algorithm..." refers methods in this paper
...3 Performance Analysis The ICEBERG [9] scheme that proposed with the objective for efficient hardware implementation was not efficient for software implementation....
[...]