Fast, parallel and secure cryptography algorithm using Lorenz's attractor
This work addresses the need for secure and fast cryptography for general-purpose applications, offering a novel approach that improves upon existing methods like AES.
The authors tackled the problem of creating a secure and efficient cryptography algorithm by developing a method based on Lorenz's attractor chaotic system, resulting in a fast parallel version with performance comparable to AES and enhanced security features like integrity assurance.
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.