Equivalence of DES and AES Algorithm with Cellular Automata

In this paper we present the equivalence of the operations involved in DES and AES algorithm with operations of cellular automata. We identify all the permutation and substitution operations involved in DES and AES algorithm and compare these operations with the cellular automata rules. Then we find that permutation operations involved in DES and AES are equivalent to linear cellular automata rules providing diffusion property of cryptography whereas substitution operations involved in DES and AES are equivalent to non linear cellular automata rules providing the confusion property of cryptography. Hence instead of using operations involved in DES and AES algorithm, we can apply linear as well as non-linear cellular automata rules in cryptography for better security and parallel processing

Modelling Nonlinear Sequence Generators in terms of Linear Cellular Automata

In this work, a wide family of LFSR-based sequence generators, the so-called Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified with a subset of linear Cellular Automata (CA). In fact, a pair of linear models describing the behavior of the CCSGs can be derived. The algorithm that converts a given CCSG into a CA-based linear model is very simple and can be applied to CCSGs in a range of practical interest. The linearity of these cellular models can be advantageously used in two different ways: (a) for the analysis and/or cryptanalysis of the CCSGs and (b) for the reconstruction of the output sequence obtained from this kind of generators.Comment: 15 pages, 0 figure

Fast, parallel and secure cryptography algorithm using Lorenz's attractor

A novel cryptography method based on the Lorenz's attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher in