2,316 research outputs found
Applications of tripled chaotic maps in cryptography
Security of information has become a major issue during the last decades. New
algorithms based on chaotic maps were suggested for protection of different
types of multimedia data, especially digital images and videos in this period.
However, many of them fundamentally were flawed by a lack of robustness and
security. For getting higher security and higher complexity, in the current
paper, we introduce a new kind of symmetric key block cipher algorithm that is
based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two
coupling parameters, as well as the increased complexity of the cryptosystem,
make a contribution to the development of cryptosystem with higher security. In
order to increase the security of the proposed algorithm, the size of key space
and the computational complexity of the coupling parameters should be increased
as well. Both the theoretical and experimental results state that the proposed
algorithm has many capabilities such as acceptable speed and complexity in the
algorithm due to the existence of two coupling parameter and high security.
Note that the ciphertext has a flat distribution and has the same size as the
plaintext. Therefore, it is suitable for practical use in secure
communications.Comment: 21 pages, 10 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
- …