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

A Novel Encryption Scheme using Cellular Automata (NESCA)

Many cryptosystems have been elaborated to ensure confidentiality and integrity of data exchanged on internet. In this context, we define and we implement a novel Encryption Scheme based Cellular Automata (NESCA). More precisely, this cryptosystem uses reversible and irreversible cellular automata to generate cipher texts and to reconstruct plain texts. The process of encryption runs on blocks according to a number of rounds applying in parallel a number of sub keys generated by cellular automata. To prove the reliability of the proposed system, an implementation is given with various tests as for instance diffusion and confusion associated to a comparison with AES-256 algorithm