FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
From MaRDI portal
Publication:3560152
Abstract: 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.
Recommendations
- CHAOS IN CRYPTOGRAPHY: THE ESCAPE FROM THE STRANGE ATTRACTOR
- A parallel encryption algorithm based on piecewise linear chaotic map
- A simple deterministic Lorenz chaotic-based methodology to cipher and decipher information
- Cryptography based on chaotic systems
- Fast low order approximation of cryptographic functions
- Secure chaotic system with application to chaotic ciphers
- Secure and computationally efficient cryptographic primitive based on cellular automaton
- Cryptography-based chaos via geometric undersampling of ring-coupled attractors
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A modified chaotic cryptographic method
- A novel block cryptosystem based on iterating a chaotic map
- CELLULAR AUTOMATA CRYPTOGRAPHIC MODEL BASED ON BI-DIRECTIONAL TOGGLE RULES
- Communication Theory of Secrecy Systems*
- Cryptography with chaos
- DESIGN OF CHAOTIC PSEUDO-RANDOM BIT GENERATOR AND ITS APPLICATIONS IN STREAM-CIPHER CRYPTOGRAPHY
- EXPERIMENTAL DEMONSTRATION OF SECURE COMMUNICATIONS VIA CHAOTIC SYNCHRONIZATION
- Heterogeneous chaotic systems based cryptography
- Improving the security of chaotic encryption by using a simple modulating method
- New directions in cryptography
- ON THE REVERSIBILITY OF 150 WOLFRAM CELLULAR AUTOMATA
- REVERSIBILITY OF A SYMMETRIC LINEAR CELLULAR AUTOMATA
- SPECTRAL PROPERTIES OF REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA
- Synchronization in chaotic systems
- TRANSITIVE BEHAVIOR IN REVERSIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA WITH A WELCH INDEX 1
Cited in
(3)
This page was built for publication: FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560152)