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.

Spontaneous recoherence of quantum states after decoherence

In this work, we identify the set of time-dependent pure states building the statistical mixture to which a system, initially in a pure state, is driven by the reservoir. This set of time-dependent pure states, composing what we term a pure basis, are those that diagonalize the reduced density operator of the system. Next, we show that the evolution of the pure-basis states reveals an interesting phenomenon as the system, after decoherence, evolves toward the equilibrium: the spontaneous recoherence of quantum states. Around our defined recoherence time, the statistical mixture associated with a special kind of initial states termed even-symmetric, spontaneously undergoes a recoherence process, by which the initial state of the system emerges from the mixture except for its reduced excitation drained into the reservoir. This phenomenon reveals that the reservoir only shuffle the original information carried out by the initial state of the system instead of erasing it. Moreover, as the spontaneously recohered state occurs only for asymptotic time, we also present a protocol to extract it from the mixture through specific projective measurements. The password to retrieve the original information stems is the knowledge of both the initial state itself and the associated pure basis. A definition of the decoherence time of an N-state superposition is also presented.